ASSIGNMENT PROBLEM

Assignment Model Approach

 The second special-purpose LP algorithm is the
assignment method
 Each assignment problem has associated with it a
table, or matrix
 Generally, the rows contain the objects or people we
wish to assign, and the columns comprise the tasks or
things we want them assigned to
 The numbers in the table are the costs associated
with each particular assignment
 An assignment problem can be viewed as a
transportation problem in which the capacity from
each source is 1 and the demand at each
destination is 1
 Assignment Model Approach
 The Fix-It Shop has three rush projects to repair
 They have three repair persons with different
talents and abilities
 The owner has estimates of wage costs for each
worker for each project
 The owner’s objective is to assign the three
project to the workers in a way that will result in
the lowest cost to the shop
 Each project will be assigned exclusively to one
worker
 Assignment Model Approach
 Estimated project repair costs for the Fix-It shop
assignment problem

PROJECT

PERSON 1 2 3

Adams $11 $14 $6

Brown 8 10 11

Cooper 9 12 7
 Assignment Model Approach
 Summary of Fix-It Shop assignment alternatives
and costs

PRODUCT ASSIGNMENT
LABOR TOTAL
1 2 3
COSTS ($) COSTS ($)
Adams Brown Cooper 11 + 10 + 7 28
Adams Cooper Brown 11 + 12 + 11 34
Brown Adams Cooper 8 + 14 + 7 29
Brown Cooper Adams 8 + 12 + 6 26
Cooper Adams Brown 9 + 14 + 11 34
Cooper Brown Adams 9 + 10 + 6 25
 The Hungarian Method
(Flood’s Technique)
 The Hungarian method is an efficient method of
finding the optimal solution to an assignment
problem without having to make direct comparisons
of every option
 It operates on the principle of matrix reduction
 By subtracting and adding appropriate numbers in
the cost table or matrix, we can reduce the problem
to a matrix of opportunity costs
 Opportunity costs show the relative penalty
associated with assigning any person to a project as
opposed to making the best assignment
 We want to make assignment so that the opportunity
cost for each assignment is zero
Three Steps of the Assignment Method

1. Find the opportunity cost table by:

(a) Subtracting the smallest number in each row of the original cost
table or matrix from every number in that row
(b) Then subtracting the smallest number in each column of the table
obtained in part (a) from every number in that column

2. Test the table resulting from step 1 to see

whether an optimal assignment can be made
by drawing the minimum number of vertical
and horizontal straight lines necessary to cover
all the zeros in the table. If the number of lines is
less than the number of rows or columns,
proceed to step 3.
Three Steps of the Assignment Method

3. Revise the present opportunity cost table by

subtracting the smallest number not covered by
a line from every other uncovered number. This
same number is also added to any number(s)
lying at the intersection of horizontal and
vertical lines. Return to step 2 and continue the
cycle until an optimal assignment is possible.
 Steps in the Assignment Method

Not
Set up cost table for problem Revise opportunity cost table
optimal
in two steps:
Step 1 (a) Subtract the smallest
number not covered by a line
from itself and every other
Find opportunity cost
uncovered number
(a) Subtract smallest number in
(b) add this number at every
each row from every number
intersection of any two lines
in that row, then
(b) subtract smallest number in
each column from every
number in that column Optimal solution at zero
locations. Systematically make
final assignments.
Step 2
(a) Check each row and column
for a unique zero and make the
Test opportunity cost table to first assignment in that row or
see if optimal assignments are column
possible by drawing the
minimum possible lines on (b) Eliminate that row and
columns and/or rows such that Optimal column and search for another
all zeros are covered unique zero. Make that
assignment and proceed in a
like manner.
 The Hungarian Method
(Flood’s Technique)

 Step 1: Find the opportunity cost table

 We can compute row opportunity costs and column opportunity costs
 What we need is the total opportunity cost
 We derive this by taking the row opportunity costs and subtract the smallest
number in that column from each number in that column
 The Hungarian Method
(Flood’s Technique)
 Cost of each person- ◼ Row opportunity
project assignment cost table

PROJECT PROJECT
PERSON 1 2 3 PERSON 1 2 3

Adams $11 $14 $6 Adams $5 $8 $0

Brown 8 10 11 Brown 0 2 3

Cooper 9 12 7 Cooper 2 5 0

Table 10.28 Table 10.29

◼ The opportunity cost of assigning Cooper to

project 2 is $12 – $7 = $5
 The Hungarian Method
(Flood’s Technique)
 We derive the total opportunity costs by taking
the costs in Table 29 and subtract the smallest
number in each column from each number in
that column
◼ Row opportunity ◼ Total opportunity
cost table cost table
PROJECT PROJECT
PERSON 1 2 3 PERSON 1 2 3

Adams $5 $8 $0 Adams $5 $6 $0

Brown 0 2 3 Brown 0 0 3

Cooper 2 5 0 Cooper 2 3 0

Table 10.29 Table 10.30

 The Hungarian Method
(Flood’s Technique)
 Step 2: Test for the optimal assignment
 We want to assign workers to projects in such a way that the total
labor costs are at a minimum
 We would like to have a total assigned opportunity cost of zero
 The test to determine if we have reached an optimal solution is
simple
 We find the minimum number of straight lines necessary to cover all
the zeros in the table
 If the number of lines equals the number of rows or columns, an
optimal solution has been reached
 The Hungarian Method
(Flood’s Technique)
◼ Test for optimal solution

PROJECT
PERSON 1 2 3

Adams $5 $6 $0

Brown 0 0 3 Covering line 1

Cooper 2 3 0

Table 10.31 Covering line 2

◼ This requires only two lines to cover the zeros so

the solution is not optimal
 The Hungarian Method
(Flood’s Technique)
 Step 3: Revise the opportunity-cost table
 We subtract the smallest number not covered by a line from all
numbers not covered by a straight line
 The same number is added to every number lying at the intersection
of any two lines
 We then return to step 2 to test this new table
 The Hungarian Method
(Flood’s Technique)
◼ Revised opportunity cost table (derived by
subtracting 2 from each cell not covered by a line
and adding 2 to the cell at the intersection of the
lines)
PROJECT
PERSON 1 2 3

Adams $3 $4 $0

Brown 0 0 5

Cooper 0 1 0

Table 10.32
 The Hungarian Method
(Flood’s Technique)
◼ Optimality test on the revised opportunity cost
table
PROJECT
PERSON 1 2 3

Adams $3 $4 $0

Brown 0 0 5 Covering line 2

Cooper 0 1 0

Table 10.33 Covering line 1 Covering line 3

◼ This requires three lines to cover the zeros so the

solution is optimal
Making the Final Assignment

 The optimal assignment is Adams to project 3, Brown to

project 2, and Cooper to project 1
 But this is a simple problem
 For larger problems one approach to making the final
assignment is to select a row or column that contains
only one zero
 Make the assignment to that cell and rule out its row
and column
 Follow this same approach for all the remaining cells
 Making the Final Assignment

 Total labor costs of this assignment are

ASSIGNMENT COST ($)

Adams to project 3 6

Brown to project 2 10

Cooper to project 1 9

Total cost 25
 Making the Final Assignment

 Making the final assignments

(A) FIRST (B) SECOND (C) THIRD

ASSIGNMENT ASSIGNMENT ASSIGNMENT

1 2 3 1 2 3 1 2 3

Adams 3 4 0 Adams 3 4 0 Adams 3 4 0

Brown 0 0 5 Brown 0 0 5 Brown 0 0 5

Cooper 0 1 0 Cooper 0 1 0 Cooper 0 1 0

Unbalanced Assignment Problems

 Often the number of people or objects to be assigned

does not equal the number of tasks or clients or
machines listed in the columns, and the problem is
unbalanced
 When this occurs, and there are more rows than
columns, simply add a dummy column or task
 If the number of tasks exceeds the number of people
available, we add a dummy row
 Since the dummy task or person is nonexistent, we enter
zeros in its row or column as the cost or time estimate
 Unbalanced Assignment Problems
 The Fix-It Shop has another worker available
 The shop owner still has the same basic problem
of assigning workers to projects
 But the problem now needs a dummy column to
balance the four workers and three projects
PROJECT
PERSON 1 2 3 DUMMY
Adams $11 $14 $6 $0
Brown 8 10 11 0
Cooper 9 12 7 0
Davis 10 13 8 0

Table 10.35