- Six workers, A, B, C, D, E and F, are to be assigned to five tasks, P, Q, R, S and T.
Each worker can be assigned to at most one task and each task must be done by just one worker. The time, in minutes, that each worker takes to complete each task is shown in the table below.
| P | Q | R | S | T |
| A | 32 | 32 | 35 | 34 | 33 |
| B | 28 | 35 | 31 | 37 | 40 |
| C | 35 | 29 | 33 | 36 | 35 |
| D | 36 | 30 | 34 | 33 | 35 |
| E | 30 | 31 | 29 | 37 | 36 |
| F | 29 | 28 | 32 | 31 | 34 |
Reducing rows first, use the Hungarian algorithm to obtain an allocation which minimises the total time. You must explain your method and show the table after each stage.