Friday, August 22, 2014

Assignment matching problem

Assume that we have  workers and  tasks to be completed. For each pair (worker, task) we know the costs that should be paid per worker to conclude the task. The goal is to conclude all the tasks and to minimize the total cost, under the condition that each worker can execute only one task and vice versa.

No comments:

Post a Comment