When there are rows/columns, where each row is a job and each row is a worker.
We need to find the lowest cost to pair (row, column):
| Job 1 | Job 2 | Job 3 | |
|---|---|---|---|
| Worker 1 |
2 | 3 | 3 |
| Worker 2 |
3 | 2 | 3 |
| Worker 3 |
3 | 3 | 2 |
Solution: 2, 2, 2 = 6
- https://github.com/devwebcl/Hungarian-Algorithm
- https://en.wikipedia.org/wiki/Hungarian_algorithm
- http://www.hungarianalgorithm.com/examplehungarianalgorithm.php
No comments :
Post a Comment