Page 205 - DCOM303_DMGT504_OPERATION_RESEARCH

Operations Research

Notes
Table 10.5: Job 1 has Least Processing Time
2 1

The new reduced table after deleting job 1 is given (Table 10.6)

Table 10.6: Reduced Table Column for Job 1 Deleted

Job 3 4 5
Machine A 9 3 10
Machine B 7 8 4

The least time is 3 for Job 4, on machine A. Place this job left to right (since it occurs in row 1) next
to job 2 as shown in Table 10.7.

Table 10.7: Job 4 has Least Processing Time

2 4 1

The reduced table after deleting job 4 is given in Table 10.8.

Table 10.8: Reduced Table, Job 4 Deleted

Job 3 5
Machine A 9 10
Machine B 7 4

The least processing time is 4 for Job 5. Place the job right to left (since it occurs in row 2) next to
job 1 as shown in Table 10.9.

Table 10.9: Job 5 has Least Processing Time

2 4 5 1

Finally we have only one job left, that is Job 3. Place the job in the empty cell as shown in Table
10.10.

Table 10.10: Job 3 Sequenced Optimal Sequence
2 4 3 5 1

The optimal sequence is thus obtained and the flow of Job 1 to Job 5 through the machine A and
the machine B will be
2  4  3  5  1
The minimum elapsed time and the idle time for machine A and machine B is shown in
Table 10.11.

200 LOVELY PROFESSIONAL UNIVERSITY