Introduction :
Introduction Useful in a situation where a certain number of tasks require to be assigned to equal number of facilities, one task to each facility.
The task differ in their capabilities.
Examples:
1 ) Jobs to machines
2 ) Sales personnel to sale territories
3) Vehicles to routes
4 ) Buildings to sites
Hungarian Method of Assignment Problem (Minimization Case) :
Hungarian Method of Assignment Problem (Minimization Case) If a constant element is added or subtracted from every element of any row or column in the given cost matrix, and assignment that minimizes the total cost in the revised matrix.
Basic Principles :
2. In an assignment matrix, solution having zero total cost is the optimal solution.
Examples of Assignment problem :
Examples of Assignment problem Type 1 :
A job production unit has four jobs Agriculture,Boating,Craft,Drelling which can be manufactured on each of the four employees Promod,Quazi,Ram and Sameer. The processing cost of each job on each machine is given in the table below .To achieve minimum processing cost, which job will you process on which machine ?
Example(contd) :
Example(contd) job employees Promod
SolutionT- 1 :
SolutionT- 1 6 STEP- 1
STEP-2 :
STEP-2 7
T-3 :
T-3 8
Step 4 : :
Step 4 : 9 0 0 0 0
Summary of final allocation :
Summary of final allocation 10
Slide 11:
THANK YOU