Question
Consider the problem of assigning five operators to five machines. The assignment costs are given in the following table.
Operator A cannot be assigned to machine 3 and operator C cannot be assigned to machine 4. Find the optimal assignment schedule.
| Operator | Machine | ||||
| 1 | 2 | 3 | 4 | 5 | |
| A | 6 | 6 | - | 3 | 7 |
| B | 8 | 5 | 3 | 4 | 5 |
| C | 10 | 4 | 6 | - | 4 |
| D | 8 | 3 | 7 | 8 | 3 |
| E | 7 | 6 | 8 | 10 | 2 |