Example 6.

\c--r tJ Find th e sequence that minimises the total elapsed time required to complete
!
th_e 0 11°wing tasks on machines M1 and M2 in the order Mi, M2° Also, find the
nnnunum total elapsed time.
Task: A B C D E F G H I
M1: 2 5 4 9 6 8 7 5 4
M2: 6 8 7 4 3 9 . 3 8 11
(MBA, Madras, April, 1997)
 T ~CESSING 'N' JOBS ON 3 MACHINES AB&
, Let there be •n' jobs each of which is to be processed through t hr88 machinessaY
. . t 1·me in all' the
Cin the order ABC. Nopassingoffjobsispermittedandactualpr~ssmg ence which
three machines is known. The problem again is to find the optimum aequ
minimizes T (Processing Time)
Mathematica11y •
Job MachineA MachineB MacbineC
1 A1 B1 Ci
2 I½
3 As Bs C:J
I I I I
i 13; C;
I I I I
n Bn 41
No general solution is available at present for such a case. However previous method
given by Johnson can be applied if the following two conditions are satisfie4, '
Condition 1. The minimum of the times for different jobs on machine A is atleast equal
to the maximum of the times of different jobs on machine B.
Condition 2. The minimum of the times for different jobs on machine C is atleast equal
to the maximum of the times of different jobs on machine B ·
i.e. Find (i) Mimimum ofAi (ii) Minimum of·Ci (iii) Maximum of Bi
Check (i) i:!! ,, and/or (ii) q =::
-....If the above two are not satisfied the.method fails otherwise we can proceed
Method. Replace the given problem with an equal problem involvmg <ii' jobs two machines
here two machines fictitious say G & H and define the corresponding processing time <j,
G. & Hi as follows :
Gi = + ~. Hi = + q, . Vi = 1, 2, 3 ...... n
Thus for the job 1 ~1 = A1 + B1; H1 = B1 + C1
for the job 2 G2 = A2 + B2, . H2 = B2 + so on
Now apply the same procedure and find out the optimal sequence which shall also be
imal for the original problem.
tv pie 9. .
machine operator has to perform 3 operations, Turning, Threading & Knurling
on qiree machines A, B & C in the order ABC. Find the optimum sequence when
the time in hours are given
t SEQUENCING PROBLEMS

Job TurningA1 Threading B1 Knurling Ci

13/13

1 ' 8 @ 18
2 12 6 14
8 4 9
4
G
6
c?11 6
8
1
12
®
18
Solution.
Min of Ai = 2 2: Max. = 8 • Not satisfied. (
Min of q = 8 2: Max. -~ = 8 • Satisfied. /
Since one of the conditions are ~sfied, the above problem can be converted into 'n' jobs,
2machines. .
Two fictitious operations G & H can be written as (in times)
Job Gi = Ai + H1 =- B1 + C1
1 3 + 8 ~Cf1.i "- - -s-+-t3-=-21-
2 12 + 6 =18 6 + 14 =20
3 5 + 4 ~ ---·--·- 4' + 9 - = 13
4 2 + 6 . -c 8 6
) 5 9 + 3 -• ·l-2- - - 3-T 8 ---.-11 - --
6 11 + 1 = 12 1·+ 13 = 14
Examining the column G i & Hi we find that the smallest time is 8 of job 4 on G, thus
we assign job 4 first as sliown 'below now delete 4 ....1L
't _ ____-T"""_--,--""T"""--,
· ·
The n~t smallest time is of job 9 3
I 4 1. I I I I
on machine G. Hence we schedule job as next to
3
I 4
also delete a. I4I3 I I I I I
~ r assigning 4 & 3, we see that there ar~ equal minimum values, processing time of 11
minutes under job 1 on G and job fi on H. According to the rule, job 1 is scheduled next
I<> 3 while job 6 is assigned last as shown 9!'1ow.
4 3 1 6
I· I I I I I I
Now jobs 2 & 6 are left.. The smallest value isl2 for job 6 on machine G so we assjgn job
6 aft.er 1 and we get the optimum seque!lce as .
4-+ 3-+ 1-+ 6-+ 2-+ 5 ·
I_ 4 I_ 3 I_ 1 I_ 6/ I_ /2 I. 5_/I
Total elapsed time for the original Problem ·
Job Turning Threading ij>JJ. .
Knurling
IN OUT IN OUT IN OUT
'2- o- 2' ~- 2" 8· -
,__ f'2.- 8,. .
20/
3/ . 2 7 ,,- 4 8 ,-- .' 12 1 20r 29_,,-
1 ./ 3 7 10 i 12 r ,, 20 t i~ 29 ,< 42 •'-
6/ II 10 21 "' , 22
2/ I ')-- 21 33'" '
33 . ,..... 39 " 13 42
ri.r 55 .
, 55
L'69
5 / q ,_33 42· ' 42 ..., 45 i 69 / ,. 77 ,
Thus the minimum elapsed time is 77 minutes idle for turning 35 = (77 - 42)
Threading = 2 + 1 + 11 + 3 + =:= 49, \r !!
Knurling -= 8 ~utes. .

'\)-
"'-"'
/4 "Y/