Assignment Problem

The document discusses the assignment problem, which aims to assign resources to activities to minimize costs. It describes the Hungarian method for solving assignment problems, which involves constructing a cost matrix and using a series of steps like identifying row/column minimums and making assignments to eventually find an optimal solution. The method is demonstrated on two examples, finding the optimal assignments and their total costs.

Uploaded by

NANDINI GUPTA

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

50 views

Assignment Problem

Uploaded by

NANDINI GUPTA

Available Formats

Download as PPTX, PDF, TXT or read online on Scribd

You are on page 1/ 82

Assignment Problem

Amit Prakash Jha

Assignment Problem
An assignment problem is a particular case of
transportation problem.

The objective is to assign a number of resources

to an equal number of activities so as to
minimise total cost or maximize total profit of
allocation.
Assignment Problem

P1 J1

P2 J2

P3 J3
Assignment Problem

COST MATRIX
Job J1 J2 J3
Person
P1 120 100 80
P2 80 90 110
P3 110 140 120
Assignment Problem

COST MATRIX
Job J1 J2 J3
Person
P1 [X11] 120 [X12] 100 [X13] 80
P2 [X21] 80 [X22] 90 [X23] 110
P3 [X31] 110 [X32] 140 [X33] 120
Assignment Problem
Hungarian Method [Steps]
Step 1:
Your problem should be balanced. Number of
rows should be equal to number of columns. If it
is not the case then add a dummy row (or
column) with zero cost elements.
Hungarian Method [Steps]
Step 2:
Subtract the smallest cost element of each row
from each element of the row (You will get first
reduced cost matrix).
Hungarian Method [Steps]
Step 3:
Subtract the smallest cost element of each
column from each element of the column (You
will get second reduced cost matrix).
Hungarian Method [Steps]
Step 4a:
Examine the rows successively and make
assignment where exactly one zero is found.
Cross all the zeros in the column corresponding
to the cell where assignment is made. Continue
till all the rows are examined.
Hungarian Method [Steps]
Step 4b:
Examine the columns successively and make
assignment where exactly one zero is found. If
you find multiple zeros then you could assign
arbitrarily where you have minimum zeros and
you may repeat the process until all zeros are
assigned or crossed.
Hungarian Method [Steps]
Step 5:
An optimal solution is found if the number of
assigned cells is equal to number of rows (or
columns). If you assigned in a cell arbitrarily then
there are multiple assignments possible. If some
rows (or columns) are left without assignment
then optimality isn’t achieved. Proceed further.
Hungarian Method [Steps]
Step 6:
Draw the minimum number of horizontal and/or
vertical lines through all the zeros. There is a
procedure to achieve this...

The Steps 6 to 9 are optional.

You are required to solve the problem through R.
Hungarian Method [Steps]
Step 6:
Draw the minimum number of horizontal and/or vertical lines through all the
zeros. There is a procedure to achieve this...
i. Mark (√) to those rows where no assignments are made
ii. Mark (√) to those columns which have zeros in marked rows
iii. Mark (√) to the rows which have assignments in marked columns (do this
step to the rows not already marked)
iv. Repeat until no more rows or columns can be checked
v. Draw straight lines through unmarked rows and marked columns
Hungarian Method [Steps]
Step 7:
If the minimum number of lines through all the
zeros is equal to the number of rows (or
columns) then optimal solution is achieved. You
may arbitrarily make assignments at the
position of zeros not crossed earlier. Else proceed
further.
Hungarian Method [Steps]
Step 8:
Revise the cost matrix
i. Find the smallest element uncovered by lines
and subtract it from all uncrossed elements
ii. Add that smallest element at the point of
intersection of two lines
Hungarian Method [Steps]
Step 9:
Go to step 4 and repeat the process till optimal
solution is reached.
Hungarian Method [Example1]

I II III IV

A 10 5 13 15
B 3 9 18 3
C 10 7 3 2
D 5 11 9 7

Cost Matrix
Hungarian Method [Example1]

I II III IV

A 10 5 13 15
B 3 9 18 3
C 10 7 3 2
D 5 11 9 7

Cost Matrix (Identify Row Minimum)

Hungarian Method [Example1]

I II III IV

A 5 0 8 10
B 0 6 15 0
C 8 5 1 0
D 0 6 4 2

First Reduced Matrix

Hungarian Method [Example1]

I II III IV

A 5 0 8 10
B 0 6 15 0
C 8 5 1 0
D 0 6 4 2