Match people to schedule templates using optimal assignment
Utilize a classic Hungarian Algorithm for improved results.
True Mathematical Optimality:
Guarantees the mathematically optimal solution, not just a good approximation
Better Rank Avoidance:
The dual variable system ensures no beneficial assignment swaps are missed and avoids lower ranks
Smarter Constraint Handling:
Strategically creates a more balanced constraint enforcement
Accurate Cost Reporting:
Final cost calculation gives true preference satisfaction metrics
1
Input Data
2
Add Constraints
3
Results
Step 1: Input Table Data
Table Data (Tab-separated)
Paste your table data with tabs between columns. First row should be headers (template names),
first column should be person names, and intersecting cells should contain rank values (1 = best,
higher numbers = worse).