- The processing time of four jobs and five machines (in hours, when passing is not allowed) is given in following table
- Find an optimal sequence for the above sequencing problem.
- Calculate minimum elapsed time & idle time for machines A, B, C, D & E.
Answer
| job | Processing time (in minutes) | |
| MachineX(A+B+C+D) | Machine Y (B+C+D+E) | |
| 1
2 3 4
|
25
24 31 31 |
23
21 27 28 |
for solution contact us :
SMU MBA fall-2017
Dear Students,
SMU MBA fall-2017 Assignments are available. For Booking ,Kindly mail us on kvsude@gmail.com OR call us to +91 9995105420 or S M S your “ Email ID ” us in the following Format “ On +91 9995105420 we will reach back you with in 24H ”
