Question: Use the Hungarian method to determine the lowest cost task-machine assignment for the next instance. Also, mention if this assignment is unique or if there
Use the Hungarian method to determine the lowest cost task-machine assignment for the next instance. Also, mention if this assignment is unique or if there are multiple optimal solutions and write the value of the objective function.
| Task 1 | Task 2 | Task 3 | Task 4 | Task 5 | |
| Machine 1 | 17 | 5 | 18 | 10 | 9 |
| Machine 2 | 13 | 15 | 16 | 21 | 16 |
| Machine 3 | 19 | 11 | 8 | 16 | 20 |
| Machine 4 | 8 | 15 | 13 | 19 | 12 |
| Machine 5 | 5 | 7 | 8 | 21 | 10 |
Please show steps
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
