Assignment Problem [AP] module solves Assignment problems with any number of Rows (m ≥2) and any number of columns (n≥2), with an objective of reducing total processing time / resources utilization.
If the AP objective is minimization, AP-Minimization tab provides the optimum solution for the Minimization problems
If the AP objective is maximization, AP-Maximization tab provides the optimum solution for the Maximization problems.
The AP Problems may be ‘balanced’ or ‘unbalanced’.
- Enter the Number of Machines [Rows]
- Enter the Number of Jobs [Columns] & Press Submit Button
- Enter the Processing time in each cell
- Save option allows you to save the problem data to the local system storage as a ‘.txt’ file
- Solution page contains Problem Statement, Modified problem, Results and Total Time of the Assignment
- There is an option to save the solution as a PDF file