Solution For Sequencing Problems

 PROCESSING OF 2 - JOBS ON ‘M‘ MACHINES (cont.):

Hence the optimal sequence is:

Job 1before 2 on machine A,

Job 2before 1 on machine B,

Job 2before 1 on machine C,

Job 2before 1 on machine D, and

Job 2before 1 on machine E.

The processing time for Job 1 = 17 hours processing 5 hours idle time (Vertical distance) = 22 hours.

The processing time for Job 2 = 20 hours processing time 2 hours idle time (horizontal distance) = 22 hours.

Both the times are same. Hence total Minimum processing time for two jobs is 22 hours.