hungarian algorithm - Assign people to tasks that require a team while minimising total time -
the classical assignment problem deals assigning n agents m jobs while minimising time spent on each job. problem has solution in polynomial time, called hungarian algorithm, has cost matrix c input , returns optimal list of assignments.
in case, got same problem, 1 difference. each job requires pair of 2 works assigned it. number of agents chosen such n number in order possible.
i new assignment problem related questions, not sure how tackle problem.
how 1 solve problem?
edit: note agent can assigned @ 1 task, can not assigned multiple tasks. 1 can assume m(jobs) = 2n(agents) , otherwise introduce dummy agent or tasks.
since there twice many tasks workers, need double number of tasks. since each task requires 2 workers, can double number of tasks duplicating each of them (ex. task 1 becomes task 1a , task 1b). have equal number of workers , tasks, , after running hungarian algorithm can find pairs of workers looking @ assigned each split of each task.
Comments
Post a Comment