Assignment Problem

Definition
Assignment Problem is a balanced transportation
problem in which all supplies and demand are
equal to 1
The Hungarian Method

Find the minimum

value in each row,
subtracting value in
each row and same
process in column.
Draw the minimum
number of lines that are
needed to cover all the
zeros in the reduced
cost matrix.
Find the smallest
nonzero element
(call its value k) in
the reduced cost
matrix that is
uncovered by lines
and add k to each
element that is
covered by two lines.
Example
Machineco has 4 machines and 4 jobs to be
completed. Each machine must be assigned to
complete one job. The time required to set up each
machine for completing each job is shown in the
table. Machineno wants to minimize the total
setup time needed to complete the four job
 Time
Job 1 Job 2 Job 3 Job 4
Machine 1 14 5 8 7
Machine 2 2 12 6 5
Machine 3 7 8 3 9
Machine 4 2 4 6 10
Solution
Xij = 1 if machine i is assgned to meet the demand
of job j
Xij = 0 if machine I is not assigned to meet the
demand of job j
Formulation of the problem
Min z = 14 x11 + 5 x12+ 8x13 + 7x14+ + 6x43+ 10x44
s.T x11 + x12+ x13 + x14 = 1 (machine constraint)
x21 + x22+ x23 + x24 = 1
x31 + x32+ x33 + x34 = 1
x41 + x42+ x43 + x44 = 1
x11 + x21 + x31 + x41 = 1 (job constraint)
x12 + x22 + x32 + x42 = 1
x13 + x23 + x33 + x43 = 1
x14 + x24 + x34 + x44= 1
Table1
minimum
row
14 5 8 7 5
2 12 6 5 2
7 8 3 9 3
2 4 6 10 2
Table 2 after subtraction row minimum

9 0 3 2
0 10 4 3
4 5 0 6
0 2 4 8

Min 0 0 0 2
Column
Table 3 after subtraction Column minimum

9 0 3 0
0 10 4 1
4 5 0 4
0 2 4 6
k = 1 (minimum value between cell not closed lines)
Subtraction cell not closed lines with k and addition
cell closer line with k.
Table 4

10 0 3 0
0 9 3 0
5 5 0 4
0 1 3 5

Optimal solution: x12 = 1, x33 = 1, x41 = 1, x24 = 1