Assignment Problem

Dr. Pasad Kulkarni

Introduction
• The problem of assignment arises because the resources that are available such as
men, machines, etc., have varying degree of efficiency for performing different
activities. Therefore, the cost, profit or time of performing different activities is
also different. Thus, the problem becomes: How should the assignments be made
in order to optimize the given objective.
• Some of the problems where the assignment technique may be useful are
assignment of (i) workers to machines, (ii) salesmen to different sales areas, (iii)
clerks to various checkout counters, (iv) classes to rooms, (v) vehicles to routes,
(vi) contracts to bidders, etc.
Hungarian Method for Solving Assignment Problem

• Step 1: Develop the cost matrix from the given problem If the number of rows are not equal to the
number of columns, then add required number of dummy rows or columns. The cost element in dummy
rows/columns are always zero.
• Step 2: Find the opportunity cost matrix
• (a) Identify the smallest element in each row of cost matrix and then subtract it from each element of that
row, and
• (b) In the reduced matrix obtained from 2(a), identify the smallest element in each column and then subtract it
from each element of that column. Each row and column now have at least one zero element.
• Step 3: Make assignments in the opportunity cost matrix The procedure of making
assignments is as follows:
• (a) First round for making assignments
• Identify rows successively from top to bottom until a row with exactly one zero element is found.
• Make an assignment to this single zero by making a square (􀂅) around it. Then cross off (×) all
other zeros in the corresponding column.
• Identify columns successively from left to right hand with exactly one zero element that has not
been assigned. Make assignment to this single zero by making a square (􀂅) around it and then
cross off (×) all other zero elements in the corresponding row.
• (b) Second round for making assignments
• If a row and/or column has two or more unmarked zeros and one cannot be chosen by inspection,
then choose zero element arbitrarily for assignment.
• Repeat steps (a) and (b) successively until one of the following situations arise.
• Step 4: Optimality criterion
• (a) If all zero elements in the cost matrix are either marked with square (􀂅) or are crossed off (×) and there is
exactly one assignment in each row and column, then it is an optimal solution. The total cost associated with
this solution is obtained by adding the original cost elements in the occupied cells.
• (b) If a zero element in a row or column was chosen arbitrarily for assignment in Step 4(a), there exists an
alternative optimal solution.
• (c) If there is no assignment in a row (or column), then this implies that the total number of assignments are
less than the number of rows/columns in the square matrix. In such a situation proceed to Step 5.
• Step 5: Revise the opportunity cost matrix Draw a set of horizontal and vertical lines to cover all the
zeros in the revised cost matrix obtained from Step 3, by using the following procedure:
• (a) For each row in which no assignment was made, mark a tick (􀀹)
• (b) Examine the marked rows. If any zero element is present in these rows, mark a tick (􀀹) to the respective
columns containing zeros.
• (c) Examine marked columns. If any assigned zero element is present in these columns, tick (􀀹) the
respective rows containing assigned zeros.
• (d) Repeat this process until no more rows or columns can be marked.
• (e) Draw a straight line through each marked column and each unmarked row.
• If the number of lines drawn (or total assignments) is equal to the number of rows (or columns), the current
solution is the optimal solution, otherwise go to Step 6.
• Step 6: Develop the new revised opportunity cost matrix
• (a) Among the elements in the matrix not covered by any line, choose the smallest element. Call this value k.
• (b) Subtract k from every element in the matrix that is not covered by a line.
• (c) Add k to every element in the matrix covered by the two lines, i.e. intersection of two lines.
• (d) Elements in the matrix covered by one line remain unchanged.
• Step 7: Repeat steps Repeat Steps 3 to 6 until an optimal solution is obtained.
Example 1
• A computer centre has three expert programmers. The centre wants
three application programmes to be developed. The head of the
computer centre, after carefully studying the programmes to be
developed, estimates the computer time in minutes required by the
experts for the application programmes as follows:
• Steps 1 and 2 The minimum time element in rows 1, 2 and 3 is 80, 80
and 110, respectively. Subtract these elements from all elements in
their respective row. The reduced time matrix is shown in Table
• the minimum time element in columns A, B and C is 0, 10 and 0,
respectively. Subtract these elements from all elements in their
respective column in order to get the reduced time matrix. This is
shown in Table
Step 3
• (a) Examine all the rows starting from the first, one-by-one, until a
row containing single zero element is found. In Table rows 1 and 3
have only one zero in the cells (1, C) and (3, A), respectively.
• Make an assignment in these cells and cross off all zero elements in
the assigned column as shown in Table
• Now examine each column starting from A in Table . There is one zero
in column B in the cell (2, B). Make an assignment in this cell as shown
in Table .
• Since the number of assignments (= 3) equals the number of rows (=
3), the optimal solution is obtained.
Example 2
• A department of a company has five employees with five jobs to be
performed. The time (in hours) that each man takes to perform each
job is given in the effectiveness matrix. How should the jobs be
allocated, one per employee, so as to minimize the total man-hours?
Min element in rows
Min element in column
Steps 3 and 4: (a) Examine all the rows starting from A,
one-by-one, until a row containing only single zero
element is found. Rows A, B and E have only one zero element
in the cells (A, II ), (B, I ) and (E, IV ). Make an
assignment in these cells, and cross off all zeros in the assigned
columns as shown in Table .
(b) Now examine each column starting from column I. There
is one zero in column III, cell (C, III ).
Assignment is made in this cell. Thus cell (C, V ) is crossed off.
All zeros in the table are now either
assigned or crossed off as shown in Table . The solution is not
optimal because only four assignments are made.
Step 5: Cover the zeros with minimum number of
lines (= 4) as explained below:
(a) Mark (√) row D where there is no assignment.
(b) Mark (√) columns I and IV since row D has
zero element in these columns.
(c) Mark (√) rows B and E since columns I and IV
have an assignment in rows B and E, respectively.
(d) Since no other rows or columns can be
marked, draw straight lines through the
unmarked rows A and C and the marked columns
I and IV, as shown in Table .
Step 6: Develop the revised matrix by selecting
the smallest element
• Step 6: Develop the revised
matrix by selecting the smallest
element among all uncovered
elements by the lines in Table ;
viz., 2. Subtract k = 2 from
uncovered elements including
itself and add it to elements 5, 10,
8 and 0 in cells (A, I), (A, IV), (C, I)
and (C, IV), respectively, which lie
at the intersection of two lines.
The revised matrix, so obtained is
shown in Table
CASE STUDY

• Case 9.1: Asian Games*

• For maintaining law and order during the Asian Games, 1982 police
force has been requisitioned from the various central police
organizations like CRPF, BSF, ITBP and other states such as Haryana,
Himachal Pradesh, Uttar Pradesh, Orissa and Gujarat. Besides this
there are 10 batalions of Delhi Police available for deployment. The
outside and the local force have been stationed at various places in
the Union Territory of Delhi. The figures are in the number of sections
(10 Men) available for deployment.
The force is to be deployed at various stadia on the day of events. The requirement of the
force has been calculated keeping in view the factors like capacity of the stadium, traffic
problems, security of VIPs and participants etc. The requirement of force is also
mentioned in number of sections.
• The cost of transportation of one section, i.e.
10 Men from every location to each stadium
has been calculated as shown in the matrix
below.
• It is assumed that the availability and
requirement of force is equal, i.e. 2,000
sections. It will not be possible on any day
during the games as all stadia are not having
games on all the days. Hence, there will
always be a surplus force available.
Consequently dummy stadium will have to be
planned everyday so as to absorb the
unutilized force. The cost (in Rs 100s for 10
persons – one section) matrix for the
movement of the police force is given below: