Documente Academic
Documente Profesional
Documente Cultură
M1
FINISH
M2
M4
2 4 8 2 6 8 16 -
4 5 6 6 11 16 22 -
5 9 4 11 20 22 26 -
1 7 3 20 27 27 30 1
6 8 1 27 35 35 36 5
Total Idle time for machine A is 1
minute (36-35)
and for machine B is 2+1+5=8 minutes.
Processing ‘n’ jobs on 3
machines
• Let there be ‘n’ jobs each of which is to processed through three
machines say A, B & C in the order ABC. No passing off jobs is
permitted and actual processing time in all the three machine is
known. The problem again is to find the optimum sequences
which minimizes T (Processing Time)
job Machine A Machine B Machine C
1 A1 B1 C1
2 A2 B2 C2
3 A3 B3 C3
i Ai Bi Ci
n An Bn Cn
• 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
satisfied.
• Condition 1: the minimum of the times for different
jobs on machine A is at least 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 at least equal to the maximum
of the times of different jobs in machine B.
i.e. Find (i) Minimum of Ai (ii) Minimum of Ci (iii)
Maximum of Bi
Check (i) Ai > Bi and/or (ii)Ci > Bi
If the above two are not satisfied the method fails
otherwise we can proceed.
Method: Replace the given problem with an equal
problem involving ‘n’ jobs two machines here
two machines fictitious say G & H and defines the
corresponding processing time i.e. Gi & Hi as
follows:
Gi = Ai + Bi, Hi = Bi + Ci
Thus for the job 1 G1 = A1 + B1, H1 = B1 + C1
For the job 2 G2 = A2 + B2, H2 = B2 + C2 so on
Now apply the same procedure and find out the
optimal sequence which shall also be optimal for
the original problem.
Ques.: A machine operator has to perform
3 operations, Turning, Threading & Knurling
on three machines A, B & C in the order ABC.
Find the optimum sequences when the time
in hours are given.
Job Turning Ai Threading Bi Knurling Ci
1 3 8 13
2 12 6 14
3 5 4 9
4 2 6 12
5 9 3 8
6 11 1 13
Solution: Min. of Ai = 2 >Max. of Bi= 8 not satisfied.
Min. of Ci = 8 > Max. of Bi = 8 satisfied.
Since one of the conditions are satisfied, the above
problem can be converted into ‘n’ jobs, 2 machines.
Two fictitious operations G & H can be written as (in
times)
Job Gi = Ai + Bi Hi = Bi + Ci
1 3 + 8 = 11 8 + 13 = 21
2 12 + 6 = 18 6 + 14 = 20
3 5+4=9 4 + 9 =13
4 2+6=8 6 + 12 = 18
5 9 + 3 = 12 3 + 8 = 11
6 11 + 1 = 12 1 + 13 = 14
• Examining the column Gi &Hi we find the smallest time is
8 of job 4 on G, thus we assign job 4 first as shown below
now delete 4.
4