1

Assignment Problem
Learning objectives:
After completing this chapter, you should be able to:
(i) Give a general description of Assignment Problem.
Assignment Problem: The assignment problem arises in a variety of decision-making
situations; typical assignment problems involve assigning jobs to machines, agents to
tasks, sales personnel to sales territories, contracts to bidders and so on. The assignment
is a problem because people possess varying abilities for performing different jobs and
therefore the costs of performing the jobs by different people are different. Obviously, if
all persons could do a job in the same time or at the same cost then it would not matter
which of them is assigned the job. A distinguishing feature of the assignment problem is
that one agent is assigned to one and only one task. Specifically, we look for the set of
assignments that will optimize a stated objective, such as minimize cost, minimize time,
or maximize profit.
Assignment problem is a special case of transportation problem in which the
number of sources and destination are the same and the objective is to assign the given
job (task) to most appropriate machine (person) so as to optimize the objective function
like minimizing cost.
Assumptions of Assignment Problem:
Following are the assumptions of Assignment Problem:
(i) Number of jobs is equal to number of machines or persons
(ii) Each man or machine is loaded with one and only one job.
(iii) Each man or machine is independently capable of handling any of the jobs
being presented.
(iv) Loading criteria must be clearly specified such as ‘minimizing operating time’
or ‘maximizing profit’ etc.
Problems Variations:
(a) Unbalanced Assignment Problem (Number of agents not equal to number of
tasks): The Hungarian method of solving an assignment problem requires that the
number of columns should be equal to the number of rows. For unbalanced
assignment problem, dummy column(s) or row(s), whichever is smaller in the
number are inserted with zeros as the cost elements. After this operation of
introducing dummy columns or rows, the problem is solved in the usual manner.
(b) Constrained Assignment Problem (Unacceptable Assignments): It happens
some times that a worker cannot perform a certain job or is not to be assigned a
particular job. To cope with this situation, the cost of performing that job by such
person is taken to be extremely large (which is written as M or ∞).
(c) Maximization objective function: In some situations, the assignment problem
may call for maximization of profit, revenue etc as the objective. For dealing with
a maximization type of assignment problem, we simply put a negative sign before
each of the pay-off values in the matrix and then solve the problem as usual
minimization problem. Alternatively, the largest of all values in the given matrix
is located and then each one of the values in the matrix is subtracted from it. Then
the problem is solved as a minimization problem.
 2

Solution methods of Assignment Problem:

There are four methods of solving an assignment problem. These methods are
(a) Enumeration method
(b) Simplex method
(c) Transportation method
(d) Hungarian method
Hungarian Assignment Method (HAM): Hungarian mathematician D. Konig first
developed the method for assignment problem and according to his country’s name the
method is called Hungarian method. It is considered an efficient method of finding the
optimal solution of AP. The method can be summarized in the following steps:
Step1: Reduce the initial matrix by subtracting the smallest element in each row
from every element in that row. Then, using the row-reduced matrix, subtract the smallest
element in each column from every element in that column.
Step2: Find the minimum number of straight lines that must be drawn through the
rows and the columns of the current matrix so that all the zeros in the matrix will be
covered. If the minimum number of straight lines is the same as the number of rows (or
equivalently columns), an optimal assignment with a value of zero can be made. If the
minimum number of lines is less than the number of rows, go to Step3.
Step3: Subtract the value of the smallest unlined element from every unlined
element, and add this same value to every element at the intersection of two lines. All
other elements remain unchanged. Return to Step2, and continue until the minimum
number of lines necessary to cover all the zeros in the matrix is equal to the number of
rows.

Question: A computer center has three expert programmers. The center wants three
application programmes to be developed. The head of the computer center after studying
carefully the programmes to be developed, estimates the computer time in minutes
required by the experts for the application programmes as follows:

Programs Programmers
A B C
1 10 15 9
2 9 18 5
3 6 14 3

Assign the programmers to the programmes in such a way that the total computer time is
minimum.
Solution: Subtracting the smallest element in each row from every element in that row.

Programs Programmers
A B C
1 1 6 0
2 4 13 0
3 3 11 0

Subtracting the smallest element in each column from every element in that column.
 3

Programs Programmers
A B C
1 0 0 0

2 3 7 0
3 2 5 0

In the above matrix, the minimum number of straight lines required to cover all the zeros
is 2. The minimum unlined element is 2. Subtracting 2 from all unlined elements and
adding 2 to the intersection element.

Programs Programmers
A B C
1 0 0 2

2 1 5 0
3 0 3 0

In the above matrix, the minimum number of straight lines required to cover all the zeros
is 3. Therefore the optimal solution has been reached.

Programs Programmers
A B C
1 0 0 2
2 1 5 0
3 0 3 0

Programmer Programme Time (in minutes)

s

A 3 6
B 1 15
C 2 5
Total 26

Question: A department head has four subordinates and four tasks have to be performed.
Subordinates differ in efficiency and tasks differ in their intrinsic difficulty. Time each
man would take to perform each tasks is given in the effectiveness matrix. How the tasks
should be allocated to each person so as to minimize the total man-hour?

Subordinates
Tasks 1 2 3 4
 4

A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10

Solution: Subtract the minimum number in each row from all numbers in that row:

Subordinates
Tasks 1 2 3 4
A 0 18 9 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0

Subtract the minimum number in each column from all numbers in that column. Then
draw the minimum number of lines to cover all zeros.

Subordinates
1 2 3 4
Tasks A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Subordinates
1 2 3 4
Tasks A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0

Now all the zeros have been either encircled or crossed. Therefore the minimum total
man-hours as follows:

Subordinates Tasks Cost

1 A 8
2 C 19
3 B 4
4 D 10
Total 41

Question: A developer with four projects in various sections of a city has received bids
from four plumbers for each of his projects. These bids are summarized below in
thousands of dollars. The developer wishes to have all projects completed simultaneously
 5

and hence will award one project to each plumber. How should the plumbers be assigned
to the projects to minimize total costs and what will this total cost be?

Plumber
P1 P2 P3 P4
Northeast 10 14 15 13
Projec Northwest 18 19 21 18
t Southeast 6 10 10 9
Southwest 12 15 17 15

Solution: Subtract the minimum number in each row from all numbers in that row:

Plumber
P1 P2 P3 P4
Northeast 0 4 5 3
Projec Northwest 0 1 3 0
t Southeast 0 4 4 3
Southwest 0 3 5 3

Subtract the minimum number in each column from all numbers in that column. Then
draw the minimum number of lines to cover all zeros.

Plumber
P1 P2 P3 P4
Northeast 0 3 2 3
Projec
t
Northwest 0 0 0 0
Southeast 0 3 1 3
Southwest 0 2 2 3

Subtract the minimum uncovered number (1) from all uncovered numbers. Add it to
numbers covered by two lines. Then draw the minimum number of lines to cover all
zeros.

Plumber
P1 P2 P3 P4
Northeast 0 2 1 2
Projec
t
Northwest 1 0 0 0
Southeast 0 2 0 2
Southwest 0 1 1 2
 6

Subtract the minimum uncovered number (1) from all uncovered numbers. Add it to
numbers covered by two lines. Then draw the minimum number of lines necessary to
cover all zeros. Since this number of lines is 4, an assignment can be found using zero
entries.

Plumber
P1 P2 P3 P4
Northeast 0 1 0 1
Projec Northwest 2 0 0 0
t Southeast 1 2 0 2
Southwest 0 0 0 1

Using these assignments and the original cost table gives the following optimal solution:

Project Plumber Cost

Northeast P1 $10,000
Northwest P4 $18,000
Southeast P3 $10,000
Southwest P2 $15,000
Total $53,000

Unbalanced Assignment Problem:

Question: A departmental head has four tasks to be performed and three
subordinates. The subordinates differ in efficiency. The estimates of time each
subordinate would take to perform is given below in the matrix. How should he
allocate the tasks, one to each man so as to minimize the total man-hour?

Men
1 2 3
I 9 26 15
Tasks II 13 27 6
III 35 20 15
IV 18 30 20

Solution: Since the matrix is not square so we add one fictitious man to make it
square.
 7

Men
Tasks 1 2 3 4
I 9 26 15 0
II 13 27 6 0
III 35 20 15 0
IV 18 30 20 0

Subtracting the smallest element in each row from every element of that row and we
get the reduced matrix,

Men
Tasks 1 2 3 4
I 9 26 15 0
II 13 27 6 0
III 35 20 15 0
IV 18 30 20 0

Subtracting the smallest element in each column from every element of that column
and we get the reduced matrix,

Men
Tasks 1 2 3 4
I 0 6 9 0
II 4 7 0 0
III 26 0 9 0
IV 9 10 14 0

Men
Tasks 1 2 3 4
I 0 6 9 0
II 4 7 0 0
III 26 0 9 0
IV 9 10 14 0

Using these assignments and the original cost table gives the following optimal solution:

Men Tasks Cost

1 I 9
2 III 20
3 II 6
Total 35

Constrained Assignment Problem (Unacceptable Assignments):

 8

Question: Four engineers are available to design four projects. Engineer 2 is not
competent to design the project B. Given the following time estimates needed by each
engineer to design a given project, find how should the engineers be assigned to
projects so as to minimize the total design time of the projects.

Projects
A B C D
1 12 10 10 8
Engineer 2 14 Not suitable 15 11
3 6 10 16 4
4 8 10 9 7
Solution: To avoid the assignment 2 B we take its time to be very large say ∝.
Subtracting the smallest element in each row from every element of that row and we
get the reduced matrix,

Projects
A B C D
1 4 2 2 0
Engineer 2 3 ∝ 4 0
3 2 6 12 0
4 1 3 2 0

Subtracting the smallest element in each column from every element of that column
and we get the reduced matrix,

Projects
A B C D
1 3 0 0 0
Engineer

2 2 ∝ 2 0
3 1 4 10 0
4 0 1 0 0

Subtracting the smallest unlined element (1) from all unlined element and adding it to
the intersection of lines

Projects
A B C D
1 3 0 0 1
Engineer

2 1 ∝ 1 0
3 0 3 9 0
 9

4 0 1 0 1

Projects
A B C D
1 3 0 0 1
Engineer 2 1 ∝ 1 0
3 0 3 9 0
4 0 1 0 1

Using these assignments and the original cost table gives the following optimal solution:

Engineer Project Cost

1 B 10
2 D 11
3 A 6
4 C 9
Total 36
Maximization objective function:
Question: A company has five jobs to be done. The following matrix shows the return in
dollar of assigning machine to the jobs. Assign the five jobs to the five machines so as to
maximize the total return.

Jobs
A B C D E
1 5 11 10 12 4
Machine 2 2 4 6 3 5
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5

Solution: As the given problem is of maximization type, first it will be reduced to a

minimization problem. This is achieved by subtracting all the elements of the
effectiveness matrix from the highest element of the matrix.
Since the highest element is 14, subtracting all the elements of the matrix from 14, the
following reduced cost matrix is obtained.

Jobs
A B C D E
1 9 3 4 2 10
2 12 10 8 11 9
Machine 3 11 2 9 0 8
4 8 0 10 3 7
5 7 5 6 2 9
Subtracting the smallest element in each row from every element of that row and we
get the reduced matrix,
 10

Jobs
A B C D E
1 7 1 2 0 8
Machine 2 4 2 0 3 1
3 11 2 9 0 8
4 8 0 10 3 7
5 5 3 4 0 7
Subtracting the smallest element in each column from every element of that column and
we get the reduced matrix,

Jobs
A B C D E
Machine 1 3 1 2 0 7

2 0 2 0 3 0
3 7 2 9 0 7
4 4 0 10 3 6
5 1 3 4 0 6

Subtracting the smallest unlined element (1) from all unlined element and adding it to
the intersection of lines

Jobs
A B C D E
1 2 1 1 0 6
Machine

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

Again, subtracting the smallest unlined element (1) from all unlined element and adding
it to the intersection of lines.

Jobs
A B C D E
1 1 0 0 0 5
Machine
 11

2 0 3 0 5 0
3 5 1 7 0 5
4 3 0 9 4 5
5 0 3 3 1 5

Jobs
A B C D E
1 1 0 0 0 5
Machine 2 0 3 0 5 0
3 5 1 7 0 5
4 3 0 9 4 5
5 0 3 3 1 5

Using these assignments and the original return-table gives the following optimal
solution:

Machine Jobs Max Return

1 C 10
2 E 5
3 D 14
4 B 14
5 A 7
Total 50