Machines Jobs: 1 2 3 4 A B C D E
Machines Jobs: 1 2 3 4 A B C D E
Find an optimal sequence for the following sequencing problems of four jobs and five machines when passing
is not allowed of which processing time (in hours) is given below: Also find the total elapsed time.
JOBS
MACHINES 1 2 3 4
A 7 6 5 8
B 5 6 4 3
C 2 4 5 3
D 3 5 6 2
E 9 10 8 6
STEPS:-
1) Find min. M1 and MK (MK is last Machine) and Max. of each M2, M3….MK-1
2) Check Whether:-
a) Min. M1 ≥ Max. MJ or (J=2,3…K-1)
b) Min. MK ≥ Max MJ
3) If the Inequalities in step-2 are not satisfied, then method fails otherwise go to next step.
JOBS
MACHINE 1 2 3 4
S
A 7 6 5 8
B 5 6 4 3
C 2 4 5 3
D 3 5 6 2
E step 2, if M2 9+ M3….MK-1=C10where C is positive
4) In addition to 8 constant6for all I=1,2…..n
Then determine the optimal sequence for n Jobs, where Two Machines are M1 and
Mk by using the optimal sequence algorithm
Gi = M1 + M2…..MK-1
Hi= M2+ M3…..+MK
Determine the optimum sequence using two machine algorithm or Johnson’s Algorithm.
MACHINE -A MACHINE-B MACHINE-C MACHINE-D MACHINE-E
JOB
IN OUT IN OUT IN OUT IN OUT IN OUT
1 0 7 7 12 12 14 14 17 17 26
3 7 12 12 16 16 21 21 27 27 35
2 12 18 18 24 24 28 28 33 35 45
4 18 26 26 29 29 32 33 35 45 51
MACHINES
JOBS
1 2 3 4
Total Elapse Time = 51 Weeks
Ideal time for machine A=(51-26) Units= 25 units A 7 6 5 8
Ideal time for machine B=(51-29)+7+2+2= 33 units B 5 6 4 3
Ideal time for machine C=(51-32)+12+2+3+1= 37 units
Ideal time for machine D=(51-35)+14+4+1= 35 units C 2 4 5 3
Ideal time for machine E=(51-51)+17+1= 18 units D 3 5 6 2
E 9 10 8 6