Siyetian Dynamic IPAd spaceSiyetian Static IPAd spaceZhongyi Fingerprint BrowserAd space
office and writing

Minimum-Cost Task Assignment

Find the minimum total cost allocation scheme to cover all tasks for multiple people and multiple tasks.

Minimum-Cost Task Assignment User manual

  1. Fill in the parameters or select the file according to the form, and check the unit and format first.
  2. The cost matrix of three-person and three-task, compare the division of labor with the smallest total cost.
  3. Click the processing button to view the results, you can copy or download and save.

Calculation method and processing rules

Use bitmask dynamic programming: each person receives at most one task and every task exactly one person. Individual assignments may be prohibited.

scope of use

Up to 20 people and 12 tasks, the number of people shall not be less than the number of tasks; use 0 to 1000000000 integer costs, and only output an optimal solution for a draw.

Will the input content be saved on the server?

This tool handles input in the browser, and does not upload files or form content. Typing practice scores are only saved in the native browser.

Why may the result be different from other tools?

Up to 20 people and 12 tasks, the number of people shall not be less than the number of tasks; use 0 to 1000000000 integer costs, and only output an optimal solution for a draw. Please compare the input unit, rounding method, applicable rules and data version first.