Advertisements
Advertisements
Question
Find the sequence that minimizes total elapsed time (in hours) required to complete the following jobs on two machines M1 and M2 in order M1-M2. Also, find the minimum elapsed time T and idle time for the two machines.
| Jobs | |||||
| Machines | A | B | C | D | E |
| M1 | 5 | 1 | 9 | 3 | 10 |
| M2 | 2 | 6 | 7 | 8 | 4 |
Sum
Advertisements
Solution
Optimal sequence :
| B | D | C | E | A |
Working Table :

Minimum elapsed time T = 30 hours
Idle time for machine M1
= 30 - 28 = 2 hours
Idle time for machine M2
= 1 + 1 + 1 = 3 hours
shaalaa.com
Sequencing in Management Mathematics
Is there an error in this question or solution?
