Minimum Cost Assignment Calculator
Assign every worker to one distinct task at minimum total entered cost using a rectangular cost matrix.
YOUR CALCULATION
Result
—
Calculation steps
Work through one step at a time or reveal the complete calculation. The steps use your current inputs.
How to calculate
Use the Hungarian potential-based assignment algorithm for a complete rectangular matrix.
Minimize Σ cost(worker,assigned task), with each worker once and each task at most once
Worked example
The default three-worker matrix assigns worker 0→task 1, worker 1→task 0 and worker 2→task 2 at total cost 9.
Assumptions and input details
Tasks must be at least workers; every pairing is allowed and has a finite numeric cost. Negative costs are permitted. No skill constraints, multiple assignments, time scheduling or inferred employee information.
Using this calculator
Can I enter my own problem?
Yes. Replace the example values with your own inputs. The result, calculation steps, tables and applicable diagrams update from those inputs. Blank or invalid values clear the result; example values are never silently substituted for missing inputs.
Are the results exact?
Results use floating-point arithmetic and displayed rounding. Read the formula, assumptions and any stated data precision before interpreting the result.
Is my input uploaded?
The calculation runs in your browser. No account, file upload or external AI service is required. Inputs are not saved between page reloads.
Find a minimum-time distinct-athlete assignment for an entered leg-time matrix.
Find a Johnson-rule job order minimizing makespan for a two-machine sequential flow shop.
Calculate earliest and latest task times, total slack and critical tasks in a dependency network.
Reserved advertising space.