In: Operations Management
The following processing times were obtained for an N-job, three-machine problem. Find the minimum makespan schedule.
Job Machine 1 Machine 2 Machine 3
1 10 1 7
2 12 3 10
3 8 5 9
4 9 2 11
5 7 4 12
6 11 6 8
Determine the optimal makespan schedule. What is the optimal makespan?
This problem is to be solved using Unbalanced Hungarian Method as follows:
So, Solution is J1 --> M2, J5 --> M1, J6 --> M3, J2 --> M6, J5 --> J4 --> M4
Here, M4, M5, M6 are dummy machines introduced in order to solve.
Formulas -