Read to Lead

Assignment Problem

  • OPERATIONS-RESEARCH
Assignment Problem The assignment problem is a special case of transportation problem. Suppose there are $n$ jobs to be performed and $n$ persons are available for these jobs. Assume that each person can do each job at a time, though with varying degree of efficiency. Let $c_{ij}$ be the cost if the $i^{th}$ person is assigned the $j^{th}$ job. Then the problem is to find an assignment so that the total cost of performing all jobs is minimum.
3 min Read 2

Hungarian Method to solve Assignment Problem

  • OPERATIONS-RESEARCH
Hungarian Method to solve Assignment Problem For obtaining an optimal assignment, Hungarian method involves following steps : Step 1 Subtract the minimum of each row of the cost matrix,from all the elements of respective rows. Step 2 Subtract the minimum of each column of the modified cost matrix, from all the elements of respective columns. Step 3 Then draw the minimum number of horizontal and vertical line to cover all the zeros in the modified cost matrix.
2 min Read 1