13 Assignment Problem

IN

13.1 Introduction
It is a special type of linear programming problem in which the objective is to
find the optimum allocation of a number of tasks (jobs) to an equal number of
facilities (persons). Here we make the assumption that each person can perform
each job but with varying degree of efficiency. For example, a departmental head
may have four persons available for assignment and four jobs to fill. Then his
interest is to find the best assignment which will be in the best interest of the
department. Assignment problem finds many applications in allocation. For
example in assigning men to works; truck or car or drivers to different roots; planes
or pilots to different commercial flights etc.
Although simplex method is powerful enough to solve all the L.P. problems, but
the above type of the problems may be solved by special procedures which are
described in the following sections.

13.2 Assignment Problem

[UP TECH MBA 2002-03, 03-04, 05-06; Rohilkhand 2000]
The assignment problem can be stated in the form of n x n, matrix [cu ] called
the cost or effectiveness matrix, where cu is the cost of assigning i-th facility
(person) to the j-th job.
Effectiveness matrix
Jobs
1 2 3 n
1 C11 C12 C13 C1j Cln

2 C21 C 22 C 23 C2j C 211

3
Persons
C11 Ci 2 Ci 3 Cif Cin

C n1 C n2 C,13 C ni C nn
490 Operations Research

n persons can be assigned to n jobs in n! possible ways. One method may be to

find all possible ri! assignments and evaluate total costs in all cases. Then the
assignment with minimum cost (as required) will give the optimal assignment. But
this method is extremely laborious. For example if n = 8, then the number of such
possible assignments is 8! = 40320. The evaluation of costs for all these allocations
will take a large time. Thus, there is a need to develop an easy computational
technique for the solution of assignment problems.
Mathematical Formulation of Assignment Problem
[Meerut L.P. 1996 (B.P.); Rohilkhand 2000]
Mathematically an assignment problem can be stated as follows :
Minimize the total cost
n n

Z= >i=1 j=1 ij .x
~
C
ij

1, if i- th person is assigned to the j- th job

where xij =
0, if i- th person is not assigned to the j- th job
Subject to the conditions

(i) = 1, j = 1, 2, ... , n

which means that only one job is done by the i-th person, i = 1, 2, ..., n

(ii) Xij = 1, 1 = 1, 2, ..., n

j=1
which means that only one-person should be assigned to the j-th job,
j = 1, 2, ...., n .

13.3 Important Theorem

Now we shall prove the following two important theorems on which the
procedure of solution of an assignment problem is based.
Theorem 1 : (Reduction theorem) : If, in an assignment problem, a constant is
added or subtracted to every element of a row (or column) of the cost matrix [cti ], then
an assignment which minimizes the total cost for one matrix, also minimizes the total
cost for the other matrix.
[Meerut 1996, 2005, 05(BP), 2010; Bhopal (Stat) 2002;
Rohilkhand 1997, 99, 2001]
or
Mathematically the theorem may be stated as follows :
n n
Ifx..=.-minimizes Z = I cij x.4 over all xij• s.t.
1=1 j=1

Xl• =1= Exi1 and x.. > 0

j=i
Assignment Problem 491
n n
then xy = Xu also minimizes Z' = c' 1 . xu
1=1 j=1
where c' = cij ± ai ±bi

ai , b j are constants, i = 1, 2, ...., n; j = 1, 2, ...., n.

Proof : We have
n n
V=
i =1 j =1
n n
E E (cii ± ai ±b j ). xij
i =1 i=1
n n n n n n
= I C-X..
1.1 11
b1• 11
i=1j=1 i=1j=1 i=1 j = 1

=Z± ai . I ± bi .
i =1 j=i j=i i =1

=Z±Ifai.1±I 1).0.
i =1 j =1

=Z±I ai
f
i =1 j =1

Since ai , bi are independent of xiiit follows that Z' is minimized when

i =1 f =1
Z is minimized
Hence, xu =Xij which minimizes Z also minimizes Z'.
Theorem 2 : If all cy _
> 0 and there exists a solution
n n
xij = Xij s. t. cij X,i = 0,
i =1 j =1
then this solution is an optimal solution (i.e. this solution minimizes Z).
Proof : Since all cu 0
n n
Z= cij Xu cannot be negative.
i = 1 j =1
Thus, its minimum value is 0, when xu = Xu
n n
Hence, the solution xy =Xij for which I cl j x = 0 is an optimal
i =1 j =1
solution.
492 Operations Research

13.4 Hungarian Method (Reduced Matrix Method)

For solving a minimal assignment problem (Assignment algorithm).
[UP TECH MBA 2001-02; Meerut 2000, 03]
From the 'above two theorems we get a powerful method termed as
"assignment algorithm" for solving an assignment problem. The procedure for
the solution is as follows :
Step 1 : Subtract the minimum element of each row in the cost matrix [cu ] from
every element of the corresponding row.
Step 2 : Subtract the minimum element of each column in the reduced matrix
obtained in the step 1 from every element of the corresponding column.
Step 3 : (a) Starting with row 1 of the matrix obtained in step 2, examine rows
successively until a row with exactly one zero element is found.
Mark (0), at this zero, as an assignment will be made there. Mark
( x ) at all other zeros in the column (in which we mark ❑ ) to show
that they cannot be used to make other assignments. Proceed in this
way until the last row is examined.
(b) After examining all the rows completely, proceed similarly
examining the columns. Examine columns starting with column 1
until a column containing exactly one unmarked zero is found. Mark
(0) at this zero and cross (mark x) at all zeros of the row in which ❑
is marked. Proceed in this way until the last column is examined.
(c) Continue these operations (a) and (b) successively until we reach to
any of the two situations.
(i) all the zeros are marked ❑ or crossed.
or (ii) the remaining unmarked zeros lies at least two in each row
and column.
In case (i), we have a maximal assignment (assignment as much as
we can) and in case (ii) still we have some zeros to be treated for which
we use the trial and error method to avoid the use of highly complicated
algorithm.
Now there are two possibilities :
(i) If it has an assignment in every row and every column (i.e., total
number of marked ❑ zeros is exactly n), then the complete optimal
assignment is obtained. (See example 1)
(ii) If it does not contain assignment in every row and every column
(i.e., the total number of marked ❑ zeros is less than n), then one
has to modify the cost (effectiveness) matrix by adding or
subtracting to create some more zeros in it. For this proceed to the
next step 4.
Step 4 : When the matrix obtained in step 3 does not contain assignment in every
row and every column then we draw the minimum number of horizontal
and vertical lines necessary to cover all zeros at least once. For this the
following procedure is adopted.
(i) Mark (I ) all rows for which assignment have not been made.
Assignment Problem 493

(ii) Mark (I ) column which have zeros is marked rows.

(iii) Mark (I ) rows (not already marked) which have assignment in
marked columns.
(iv) Repeat step (ii) and (iii) until the chain of marking ends.
(v) Draw minimum number of lines through unmarked rows and
through marked columns to cover all the zeros.
This procedure will yield the minimum number of lines (equal to the
number of assignments in the maximal assignment obtained in step 3)
that will pass through all zeros.
Step 5 : Select the smallest of the elements that do not have a line through them,
subtract it from all the elements that do not have a line through them,
add it to every element that lies at the intersection of two lines and leave
the remaining elements of the matrix unchanged.
Step 6 : At the end of step 5, number of zeros are increased (never decreased) in
the matrix than that in step 3.
Now re-apply the step 3 to the modified matrix obtained in step 5, to
obtain the desired solution. For the clear understanding of the procedure
see Example 4.

glluAlhativp jxamplea
Example 1 : Solve the following minimal assignment problem :
Man --> 1 2 3 4
Job
I 12 30 21 15
II 18 33 9 31
III 44 25 24 21
IV 23 30 28 14
[Agra 2000]
Solution : For the clear understanding, this example is solved step by step
systematically.
Step 1 : Subtracting the smallest element of each row from every element of the
corresponding row, we get the following matrix :
1 2 3 4
I 0 18 9 3
II 9 24 0 22
III 23 4 3 0
IV 9 16 14 0
494 Operations Research

Step 2 : Subtracting smallest element of each column from every element of the
corresponding column, we get the following matrix :
1 2 3 4
I 0 14 9 3
II 9 20 0 22
III 23 0 3 0
IV 9 12 14 0
Step 3 : Now we test whether it is possible to make an assignment using the zeros
by the method described in step 3 on page 492.
Starting with row I, we mark ❑ (i.e., make assignment) in the row containing
only one zero and cross (x) the zeros in the corresponding column in which D lies.
Thus, we get the following table :
2 3 4
I D
O 14 9 3
II 9 20 22

III 23 0 3 X

IV 9 12 14

Again starting with column 1, we mark 0 (i.e., make assignment) in the

column containing only one unmarked or uncrossed zero in the above table and
cross out the zeros in the corresponding row in which this assignment D is marked.
Thus, we get the following table :

1 3 4
I 14 9 3
11 9 20 CI 22

III 23 E 3 X

IV 9 12 14 El
Since in the last table, every row and every column have one assignment, so we
have the complete optimal zero assignment.
Job I II III IV
Man I 3 2 4
which is the optimal assignment.
Assignment Problem 495

Example 2 : A department head has four subordinates, and four tasks to be

performed. The subordinates differ in efficiency and the tasks differ in their intrinsic
difficulty. His estimate of the times each man would take to perform each task is given
in the effectiveness matrix below. How should the task be allocated, one to a man, so as
to minimize the total man hour ?
Subordinates
I II III IV
A 8 26 17 11
Tasks B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
[Rohillchand 1997, 1999, 2003]
Solution : Step 1 : Subtracting the smallest element in each row from every element
of the corresponding row, we get the following matrix :
I II III IV
A 0 18 9 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0
Step 2 : Subtracting the smallest element in each column of the above matrix from
every element of the corresponding column, we get the following matrix :

I II HI IV

A 0 14 9 3

B 9 20 0 22

C 23 0 3 0

D 9 12 14 0

The above matrix is the same as obtained in step 3 in Example 1, therefore for
minimum man hours the allotment should be as follows :
Tasks A B C D
Subordinates I III II IV
Man hours 8 4 19 10
and the total Man hours are 8 + 4 + 19 + 10 = 41.
496 Operations Research

Example 3 : Solve minimal assignment problem whose effectiveness matrix is

I II III IV
A 2 3 4 5
B 4 5 6 7
C 7 8 9 8
D 3 5 8 4
[Meerut 2002 (BP), 03 (BP); L.P. 1995; Agra 2003]
Solution :
Step 1 : Subtracting the smallest element of each row from every element of the
corresponding row, we get the following matrix :
I H III IV
A 0 1 2 2
B 0 1 2 3

C 0 1 2 1
D 0 2 5 1

Step 2 : Subtracting the smallest element of each column of the above matrix
from the corresponding column, we get the following matrix :
I II III IV

A 0 0 0 2
B 0 0 0 2
C 0 0 0 0
D 0 1 3 0

Step 3 : Now we test whether it is possible to make an assignment using the zeros
of the above table by the method described in step 3 on page 492.
Since none of the rows or columns contain exactly one
zero, therefore the trial and error method is followed. Now we start
searching two zeros. Starting with row 1 we find row 4 which contain
two zeros. We make the assignment at the first zero as shown in table 1
and cross out the other zero in this row and all the other zeros of the first
column in which we have made the assignment 0. Now starting with
column 1 we find column 4 which contain one zero and make assignment
❑ at the zero of row 3 and cross out all other zeros of this row. Now again
starting with row 1 we search row containing only one zero but we find
no such row. The same is true when we check the columns for one zero.
Again we start with row 1 searching two zeros and find the row (row 1)
containing two unmarked zeros. We can make as assignment at any one
Assignment Problem 497

of these zeros and cross out the other zero and zeros of the corresponding
column in which assignment is made (see table 1 and 2). If we made an
assignment in first row, second column and-crossed other zero and zeros
of second column then the second row contain only one t ero, in third
column where we can make an assignment. Similarly if we made an
assignment in first row, third column and crossed zeros of third column
then the second rove contain only one zero irrsecond column where we
can make an assignment (see table-2).
Table 1 Table 2

I II III IV I II III
A 8 ID X 2 S El 2

B X X 1:1 2 X Q X 2

c X X X X X X n
1 3 X El 1 3 X

Thus, we get the following two assignments.

A ---> ,B --> , C IV, D— I
and A --> ,B —> II,C —> IV,D ---> I
In both cases minimum cost = Rs. 20

Note : Other assignments also exist. Students may try to find them.

Example 4 : Solve the assignment problem represented by the following matrix :

I II III IV V VI

A 9 22 58 11 19 27

B 43 78 72 50 63 48

41 28 91 37 45 33

D 74 42 27 49 39 32

E 36 11 57 22 25 18

F 3 56 53 31 17 28

[Meerut L.P. 1990; Rufulkhand 1996]

Solution :
Step 1 : Subtracting the smallest element of each row from every element of the
corresponding row, we get the following reduced matrix :
498 Operations Research

1 II III VI

A 13 49 2 10 18
B 0 35 29 7 2C 5
C 13 0 63 9 17 5
D 4 15 0 22 12 5
E 25 0 46 11 14 7
F 0 53 50 28 14 25

Step 2 : Subtracting the smallest element of each column from every element of
the corresponding column, we get the following reduced matrix :

I 11 III IV V VI

A 0 13 49 0 0 13
B 0 35 29 5 10 0
C 13 0 63 7 7 0
D 47 15 0 20 2 0
25 0 46 9 4 2
F 0 53 50 26 41 20

Step 3 : Now we give the zero assignments in our usual manner and get the
following matrix :

X 13 49 X 13
35 29 5 10
13 X 63 7 7 X
47 15 20 2 X
25 I] 46 9 4 2

ri 53 50 26 4 20

Since row 3 and column 5 have no assignments so we proceed to the next step.
Step 4 : In this step we draw minimum number of lines to cover all zeros at least
once. For this we proceed as follows :
Assignment Problem • 499

L4.• 49 El
35 29 5 . 10 [11

13 X 63 7 7 X
47 15 0 20 2

25 MI 46 9 4 2

D 5:3 50 26 4 2p

6
(i) We mark ) row 3 in which there is no assignment.
(ii) Then we mark (I ) columns 2 and 6 which have zeros in marked
row 3.
(iii) Then we mark (✓ ) rows 5 and 2 which have_ assignments in the
marked colunins 2 and 6. • •.
(iv) Then we mark column 1 (not already marked) which has zero in the
marked row 2.
(v) • Then we mark row 6 [Link] assignment in the marked column 1; •
(vi) Now•we draw lines through all marked. columns .1, 2, 6:. Then we
draw lines through unmarked row 1 and 4 having zeros through
which [Link] no line. ThuS, we get five lines (minimum number) to •
cover all the zeros.
Step 5 : Now the. smallest of the elements that do [Link] a line through them is
• 4. Subtracting this element 4 from all the elements that do not have aline
through them and adding to [Link] that lies at the intersection of
two lines and leaving the remaining elements unchanged, we get the
• following matrix :
- I II III IV V VI
A 4 17 49 17
El 35 25. 1 6

C 13 )6( 59 3 3 E
D 51 19 El 20 2 4
E 25 E] 42 5 X 2

F 53 46 22 Q 20

Step 6 : Again repeating the step 3 we make the zero assignments and get the
following matrix (see above table) :
Thus, the optimal assignment is
A •-> /V, B I,C VI, D E F V
500 Operations Research

and minimum cost, Z =11+ 43 + 33 + 27 + 11 + 17 = 142.

(from the given cost matrix)
Another optimal solution of the assignment problem is as follows.
A —) IV, B --) VI, C --> D E ---> V, F --> I.

I II III IV V VI
A 4 17 49 X, 17
X 35 25 1 6 0
C 13 59 3 3 X

D 51 19 20 2 4
25 X 42 2

B 53 46 22 X 20

In this case minimum cost

Z = 11 + 48 + 28 + 27 + 25 + 3
= 142 (from the given cost matrix) which is equal to the minimum cost for the
first solution.
Example 5 : Solve the following assignment problem.
Man
I II III IV V
A 1 3 2 3 6
B 2 4 3 1 5
Task C 5 6 3 4 6
D 3 1 4 2 2
E 1 5 6 5 4
[Meerut 2005; Rohilkhand 20001
Solution :
Step 1 and 2 : Applying step 1 and 2 we obtain the following matrix :
I II III IV V
A 0 2 1 2 4
B 1 3 2 0 3
C 2 3 0 1 2
D 2 0 3 1 0
0 4 5 4 2
Assignment Problem 501

Step 3 : Giving the zero assignment in our usual manner we get the following
matrix :
/ L.1 II III IV V
A I=1 2 1 2 4 ✓()
B 1 3 2 ..........3 L2
El
2 .. -.3 1 2 L3

2 E3 3 1 .L4

4 5 4 2
✓

Since row 5 and column 5 have no assignments, so we proceed to the

next step.
Step 4 : The minimum number of lines drawn in the usual manner are 4 (see
above table).
Step 5 : Now the smallest of the elements that do not contains line through them
is 1. Subtracting this element 1 from the elements that do not have a line
through them, adding to every element that lies at the intersection of two
lines and leaving. the remaining elements unchanged, we get the
following matrix
L2
II II ! III IV V
A 1 lir, 1 3
B 3 2 3..

C 3 1 2

3 1:3 3 X • L4

E 3 3 1 ✓(ID

0
Step 6 : Again repeating the step 3 we make the zero assignments in matrix
(above table) and see that even now the row 1 and column 5 do not
contain any assignments. Therefore we again repeat step 4 of drawing
lines.
Step 7 According to our usual manner the minimum number of lines drawn are
4 (see table in step 5).
502 Operations Research

Step .8 : Again repeating step 5, we get following matrix

II III . IV V
A El X 2
B 3 3 2 3
C 3 .2 D X
D 4 E] 4 1 X
E 8 2 4 2 El

Step 9 Repeating the step 3 we make the zero assignments and get the
following optimal assignments, (see above table).
A I, B ----> IV, C D B V.
The minimum cost, Z = 1 + 1 + 3 + 1 + 4 = 10
Example 6 : An air-line that operates seven days a week has time-table shown below.
Crews must have a minimum:layover of 5 hours between flights. Obtain the pairing of
flights that minimizes layover time away from home. For any given pairing the crew
will he based at the city that results in the smaller layover.

Delhi-Jaipur Jaipur-Delhi •

Flight Flight
No. Departure Arrival No. Departure Arriyal
1 7.00 A.M. 8.00 A.M. 101 8.00 A.M. 9.15 A.M.
2 8.00 A.M. . 9.00 A.M. 102 8.30 A.M. 9.45 A.M.
3 1.30 P.M. 2.30 P.M. 103 12.00 Noon 1.15 P.M.
4 6.30 P.M. . 7.30 P.M. 104 5.30 P.M. 6.45 P.M.

For each pair also mention the town where the creu., should be based.
[Meerut 2002 (BP), 03 (0); 09]

Solution :
Step 1 : First we construct the table forlayover times between flights when crew
is based at Delhi i.e., crew start from and come back to Delhi with halt of
minimum time (layover time) not less than 5 hours, at Jaipur.
Since the crew must have a minimum layover of 5 hours between
flights, the layover time between flights 1 and 101 will be 24 hours. Also
the layover times between flight 1 and 102, flights I and 103, flights 1
and 104 aret24.5 hours, 28 hours, 9.5 hours respectively. Similarly the
layover times between other pairs of flights may be calculated which are
shown in the following table :
Assignment Problem 503

Layover times in hours when crew based at Delhi

Table 1
Flights -4 101 102 103 104

1 24 24.5 28 9.5
2 23 23.5 27 8.5
3 17.5 18 21.5 27
4 12.5 13 16.5 22

Now we construct the table for layover times between tie pair of flights
when the crew is based at Jaipur i.e., crew start from and come back to Jaipur
with minimum halt time (layover time) not less than 5 hours, at Delhi.
Since the plane arrive at Delhi at 9.15 A.M. by flight No. 101 and will
depart to Jaipur at 7.00 A.M. by flight No. 1 after 21.75 hours. Therefore,
layover time between pair of flight No. 101 and 1 is 21.75 hours. Similarly, the
layover times between other pairs of flights may be calculated which are shown
in table 2 :
Layover times when crew based at Jaipur
Table 2
Flights 1 2 3 4

101 21.75 22.75 28.25 9.25

102 21.25 22.25 27.75 8.75
103 17.75 18.75 24.25 . 5.25
104 12.25 13.25 18.75 23.75

Table 2 can also be written as follows :

Table 3
Flights -4 101 102 103 104

1 21.75 21.25 17.75 12.25

2 22.75 22.25 18.75 13.25
3 28.25 27.75 24.25 18.75
4 9.25 8.75 5.25 23.75
504 Operations Research

Step 2 : To avoid the fractions we consider either the layover times in terms of
quarter hour as one unit of time or the layover times for four weeks. Thus,
multiplying the matrices (tables 1 and 3) by 4, the modified matrices are
as follows (table 4 and 5) :
(Crew based at Delhi) Table 4
Flights —> 101 102 103 104

1 96 98 112 38
2 92 94 108 34
14 ,
3 70 72 86 108
4 50 52 66 88

(Crew based at Jaipur) Table 5

Flights —> 101 102 103 104

87 85 71 49
91 89 75 53
113 111 97 75
37 35 21 95

Step 3 : Now we combine the table 4 and 5, choosing that base which gives a
lesser layover time for each pairing. The layover times marked with 1"'
denote crew based at Jaipur. Otherwise the crew in based at Delhi. Thus,
we get the following table :
Table 6 (Minimum layover time table)

87* 85* 71* 38

91* 89* 75* 34

70 72 86 75*

37* 35* 21* 88

Step 4 : Subtracting the smallest element of each row from every element of the
corresponding row and then subtracting the smallest elenient of each
column from every element of the corresponding column, we get the
following matrix (table 7): :
Assignment Problem 505

Table 7
L3

45* 33* El ✓
53* 41* X
X '6 S* L1

6;7 L2

Step 5 : Giving the zero assignments (see table 7) we find that there is no
assignment in row 2 and column 2, so we draw minimum number of lines
to cover all the zeros as shown in table 7 :
Step 6 : Now subtracting the smallest uncovered element 33 from all uncovered
elements and adding it to the elements which lie at the intersection of
lines and leaving other elements as usual the matrix obtained is as follows :
(table 8).
Step 7 : Giving the zero assignments we can find that there is no assignment in
row 1 and column 2, so we again draw minimum number of lines to cover
all the zeros as shown in table 8 :
Table 8
L2 L3

16* 12* ral

24* 20* *
ski: 16
4-6* 12* 100

0
Step 8 : Proceeding again as in step 6 the final matrix obtained is as follows
(table 9) :
Table 9
101 102 103 104
1 4* 0* 0* 0
2 12* 8* 8* 0
3 0 0 28 50*
4 9" 0* 0" 100
506 Operations Research

Step 9 : Giving the zero assignments, we get the following two optimal
assignments (table 10 and 11) :

Table 10 Table 11

101 102 103 104 101 102 103 104

4* El* X.* X 1 4* )3; * 0* X
2 12* 8* 8* 2 12k 8* 8* E
3 ID X 28 50* 3 El N's 28 50*

4* X* 0* 100 4 4* a :le 100

Hence the required city for crew for pairing of flights for minimum layover time
is as follows :
(1) 1 102 (Crew at Jaipur), 2 > 104 (Crew at Delhi)
3 —> 101 (Crew at Delhi), 4 —> 103 (Crew at Jaipur)
(ii) 1 103 (Crew at Jaipur), 2 —> 104 (Crew at Delhi)
3 101 (Crew at Delhi), 4 —> 102 (Crew at Jaipur)
In both the cases minimum layover time is 210 hours for four weeks i.e., 52
hours 30 minutes per week,
Example 7 : A small aeroplane company, operating seven days a week, serves three
cities A, B and C according to the schedule shown in the following table. The layover cost
per stop is roughly proportional to the square of the layover time. How should planes be
assigned the flights so as to minimize the total layover cost ?
•
Flight No. From Departure To Arrival
Al B A 09 A.M. B Noon
A2 B A 10 A.M. B 01 P.M.
A3 B - A 03 P.M. B 06 P.M.
A4 C A 08 P.M. C Midnight
A5 C A 10 P.M. C 02 A.M.
B1 A B 04 A.M. A 07 A.M.
B2 A B 11 A.M. • . A 02 P.M.
23 A B 03 P.M. A 06 P.M.
C1 A C 07 A.M. A 11 A.M.
C2 A C 03 P.M. A 07 P.M.

[Agra 1998]
Solution : From the data given in the problem, we note that :
(i) Five planes are operating at a time.
(ii) Any plane flying from a station must come back within 24 hours for the
scheduled trip.
Assignment Problem 507

(iii) A plane starting from A for B or C must come back to A at the earliest possible
opportunity.
(iv) A plane cannot make more than 2 trips in 24 hours i.e., it will just go from A and
will come back to A within 24 hours.
First we consider the [Link] matrix for the flights between A and B.
A plane from A to B through the B
route A1B may Come back to A through A 09 AM A,B Noon B

any of the routes BO, B2A or B3A. The

plane A depart from A at 9 A.M. and
arrives at B at noon i.e., at 12 P.M. It may
go. back to A by flights Bi A, B2A, B3A at
04 A.M., 11 A.M., 03 P.M., respectively.
So its layover times at B for these flights
will be 16 hours, 23 hours, 3 hours
respectively. The flights ill A, B2A, B3 A reaches A at 07 A.M., 02 P.M., 06 P.M.
respectively and will depart from A for B at 09 A.M. Thus, the layover times of these
flights Bi A, B2A, B3A at A will be 2 hours, 19 hours and 15 hours respectively. Thus
the layover costs for the routes AT B to BT A, is 162 + 22 = 260 units.
Note that the flights for the routes A1B to B2A is not completed within 24
hours. So this route is not allowed. Thus the cost of layover time for this route is
considered to be very high, say co to avoid this route. The. layover costs for the route
A1B to. B3A is 32 + 152 = 234 units.
Similarly, the layover costs for the routes A2B to B1 A, A2B to B2A, A2B to B3A
are 152 + 32 = 234 units, co and 22 + 162 = 260 units respectively.
A 10 AM A2B 01 PM B

And the layover costs for the routes A3B to BO, A3B to B2A, A3B to B3A are
102 + 82 = 164 units, 172 + 12 = 290 units and co respectively.
A 03 AM A3B 06 PM B

07 AM B1A 04 AM

02 PM 13,A 11 AM

B3A 03 PM

Thus, the layover costs for the three planes flying between stations A and B in
different routes are as shown in the following table :
508 Operations Research

B1 A B2A B3A
A1B 260 . 234
A2B 234 . 260
A3B 164 290 00

Solving this as an assignment problem the optimal assignment is given in the

following table :
BiA B2A B3A
A 1B 26 00 El
A2B El - 26

A3B X 00

Now we construct the layover costs matrix for the flights between A and C,
which is as follows :

C1 A C2A
A4C 72 + 92 = 130 152 + 12 = 226

A5C 52 + 112 =146 132 + 32 =178

r

C
2 AM

Solving this as an assignment problem, the optimal assignment is given in the

following table :

CI A C2A
A4C 64

A5C X
Assignment Problem 509

Hence, the optimal route schedule for minimum layover is as follows :

Plane No. 1 ,2 3 4 5
Departure Route A1 B A2B A 3B A 4C A 5C
Arrival Route B3 A Bi A B2A Ci A C2 A

13.5 Unbalanced Assignment Problems

An assignment problem is called an unbalanced assignment problem
whenever the number of tasks (jobs) is not equal to - the number of facilities
(persons). Thus, the cost matrix of an unbalanced assignment problem is not a
square matrix. For the solution of such problems we add the dummy rows or
columns to the given matrix to make it a square matrix. The costs in these dummy
rows or columns are taken to be 0. Now the problem reduce to the balanced
assignment problem and. can be solved by assignment algorithm 13.4.

MA&atiOR EXaMPICTA
Example 8 : A company is faced with the problem of assigning six different machines
to five different jobs. The costs are estimated as follows (hundreds of rupees).
Job
1 2 3 5
1 2.5 5 1 6 1
2 2 5 1.5 7 3
3 3 6.5 2 8 3
Machine 4 3.5 7 2 9 4.5
5 4 7 3 9 6
6 6 9 5 10 6

Solve the problem assuring that the objective is to minimise total cost.
Solution : Since the given matrix is not a square matrix, we add one fictitious job
6 (sixth column) to make it a square matrix: Thus, the resulting matrix obtained is as
follows :
1 2 3 4 5 6
1 2.5 5 1 6 1 0
2 2 5 1.5 7 3 0
3 3 6.5 2 8 3 0
4 3.5 7 2 9 4.5 0
5 4 7 3 9 6 0
6 6 9 5 10 6 0
51Q Operations ReSearch
Step 1 and 2 : Subtracting the smallest element of each row from every element of
the con esponding row and then subtracting smallest element of each column
from every element of the corresponding column, we get the following matrix. •
1 2 3 4 5 6
0.5 0 0 0 0 0
2 0 0 0.5 1 2 0
3 1 1.5 1 2 2 0
4 1.5 2 1. 3 3.5 0
5 2 2 2 3 5 0
6 4 4 4 4 5 0
Step 3 : Giving zero assignments in the usual manner, we observe that thesows 3,
4, 5 and columns 4, 5, 6, have no zero assignments. So we proceed to the
next step :
L3
2 3 4 5 6
Li 1. 0:5 ;13:
L2-2. 0:5 1 2
3 1 1.5 1 2 2

4 1.5 2 1 3 3.5 X
5 2 2 2 •3 5
6 4 4 4 4

I•

Step 4 : Here we draw minimum number of lines (horizontal and vertical) to

cover all the zeros at least once. The number of such lines is 3. See table
in step 3.
Step 5 : Since the smallest element among all uncovered elements in the above
table is 1, so subtracting this element 1 from all uncovered elements,
adding to every elements that lies at the intersection of two lines and
leaving remaining elements unchanged, the above table reduces to the
following form.
1 2 3 4 5 6
1 0.5 0 0 0 0 1
2 0 0 0.5 1 2 1
3 0 0.5 0 1 1 0
4 0.5 1 0 2 2.5 0
5 1 1 1 2 •4 0
6 3 ' 3 3 3' 4 0
Assignment Problem 511

Step 6 : Giving zero assignments in the usual manner, we observe the row 6 and
column 5 have no zero assignments. So we proceed to the next step :

L5
1 2 3 4 5 :6
L1..1. 0:5 :ers 53: p.8;

E 0:5 1
L3 3- 0:5 X 1 1
L4 4- 1 0 2 2.5 X
5 1 1 1 2 4 I®
6 3 3 3 3 4 Jo

Step 7 : We again draw minimum number of lines (horizontal and vertical) to

cover all zeros at least once. The number of such lines is 5. See table in
step 6.
Step 8 : Since the smallest element among uncovered elements in the above table
is 1, so subtracting this element 1 from all uncovered elements, adding to
every element that lies at the intersection of two lines and leaving
remaining elements unchanged, the above table reduces to the following
form.

3 4 5 6

1 0.5 0 0 0 0 2

2 0 0 0.5 1 2 2

3 0 0.5 0 1 1 1

4 0.5 1 0 2 2.5 1

5 0 0 0 1 3 0

6 2 2 2 2 3 0

Step 9 : Giving zero assignments in the usual maniter, we observe that row 2 and
column 5 have no assignments. (see table on page 512) So we proceed to
the next step.
512 Operations Research

L2 L3 L4
• 6
z. El :14; 2
X 05 1 2 2

05 1 ✓

4 05 2 2.5

:E4( X 1 3

• 2 2 3

Step 10: Here we again draw minimum number of lines (horizontal and vertical)
to cover all the zeroes at least once. The number of such zeroes is 5. See
table in step 9.
Step 11: Since the smallest element among all uncovered elements is 1, so
subtracting this elements 1 from all uncovered elements, adding to every
elements that lies at the intersection of two lines and leaving remaining
elements unchanged, the above table reduces to the following form :
1 2 3 4 5 6
1 1.5 1 1 0 0 3
0 0 0.5 0 1 2
3 0 0.5 0 0 0 1
4 0.5 1 0 1 1.5 1
5 0 0 0 0 2 0
6 2 2
,, 2 1 2 0

Step 12 : Giving zero assignments in the usual manner we get the optimal
assignments given by the following tables :
1 2 3 4 5 6 1
1 1.5 1 1 0 X 3 1.5 1 1 El R 3
2 0 )3( 0.5 X 1 2 2 )3( El 0.5 )3( 1 2
3 X 0.5 El 1 3 X 0.5 X X El 1
4 0.5 1 El 1 1,5 1 4 0.5 1 DO 1 1.5 1
5 XDX X 2X 5 El X X )3( 2 X

6 2 2 2 1 2 2 2 2 1 2 1:1
Assignment Problem 513

1 2 3 4 5 6 1 2 3 4 5 6
1 1.5 1 1 B E 3 1 1.5 1 1 X El) 3
2 0.5 X 1 2 2 :a 0.5 X. 1 2
3 )31: 0.5 X X 1 3 CI 0.5 )3(B :8; 1
4 0.5 1 R-1
) 1 1.5 1 4 0.5 1 1 1.5 1
5 ;$3( p X X 2 X 5 XI p 2 X
6 2 2 2 1 2 rni 6 2 2 2 1 2 El

1 2 3 4 5 6 1 2 3 4 5 6
1 1.5 1 1 X E 3 1 1.5 1 1 1 E] 3
2 X El 0.5 B 1 2 2 B B 0,5 Di 1 2
3 X 0.5 X :€1: 1 3 D) 0.5 1
4 0.5 1 1 1.5 1 4 0.5 1 1 1.5 1
5 El X X X 2 5 XOXX 2 X
6 2 2 2 1 2 11 6 2 2 2 1 2 g

Hence, the optimal solutions are

1—> 4, 2 —> 1, 3 —> 5, 4 —> 3, 5 —> 2, 1 —> 4, 2 —> 2, 3 —> 5, 4—> 3, 5 —> 1
1 —> 5, 2 —> 1, 3—> 4, 4—> 3, 5 —> 2, 1 —> 5, 2—> 2, 3—> 1, 4—> 3, 5 --4 4
1—> 5, 2 —> 2, 3 —> 4, 4—> 3, 5 —> 1, 1 --> 5, 2—> 4, 3 —> 1, 4 —> 3, 5 —> 2
In all the optimal solutions 6th machine do no job and the minimum total cost
in all cases is Rs. 20 x 100 i.e., Rs. 2000.

13.6 Maximization Assignment Problem

Some times the assignment problem deals with the maximization of the
objective function i.e., the problem may be to assign persons to the jobs in such a
way that the expected profit is maximized. Such maximization problem may be
solved by converting it to minimization problem. This is done converting the profit_
matrix to the cost (i.e., loss) matrix in either of the following two ways.
(1) Subtract each element of the given matrix (Profit matrix) from the greatest
element of the matrix to get the equivalent cost (i.e., loss) matrix.
or
(ii) Place minus sign before each element of the profit matrix to get the equivalent cost
matrix.
514 Operations Research

gliathtadog Exams
Example 9 : Alpha corporation has four plants each of which can manufacture any of
the four products. Production costs differ from plant to plant as do sales revenue. From
the following data, obtain which product each plant should produce to maximize profit ?

Sales revenue Production cost

(Rs. 1000) (Rs. 1000)
Product Product
Plant 1 2 3 Plantl 1 2 3 4
A 50 68 49 62 A 49 60 45 61
B 60 70 51 74 B 55 63 45 69
C 55 67 53 70 C 52 ' 62 49 68
D 58 65 54 69 D 55 64 48 66
[Bangalore B.E. 1990]
Solution : Since, Profit = Sales revenue — Product cost, so the profit matrix is as
_-
follows :

2
A
B
C

which is'Aia-kimization problem. We shall solve this problem by converting it to

minimization problem in both way discussed in article 13.6.
1. By way (9_4 Subtracting each element of the above matrix from the greatest
element the matrix, the equivalent loss matrix is

1 2 3 4
7 0 4 7
3 1 2 3
C 5 3 4 6
D 5 7 2 5

Step 1 and 2 : Subtracting the minimum element of each row from all the
elements of the corresponding row and then subtracting minimum element of
each column from all the elements of the corresponding column, we get the
following matrix.
Assignment Problem 515

2 3 4
A 5 0 4 5
B 0 0 1 0
C 0 0 1 1
D 1 5 0 1

Step 3 : Giving zero assignments in the usual manner, we get the following matrix.
1 2 3 4
A
B
C

In the above table there is an assignment in each row and each column. Hence
the optimal assignment for maximum profit is
A 2, B 4, C --> 1, D -> 3
and Max. Profit = Rs. (8 + 5 + 3 + 6) x 1000 = Rs. 22000
2. By way (ii) : Placing negative sign before each element of the profit matrix, the
equivalent loss matrix is

2 3 4
A —1 —8 —4 —1
B —5 —7 —6 —5
C —3 —5 —4 —2
D —3 —1 —6 —3

Now subtracting the minimum element of each row from every elements of the
corresponding row and then subtracting the minimum element of each column from
every element of the corresponding column, we get the following matrix.

1 2 3 4
A 5 0 4 5
B 0 0 )1 0
C 0 0 1 1
D 1 5 0 1

Which is the same matrix as obtained in step 1 and 2 in way (0. Hence giving
zero assignments we get the same optimal solution as by way (0.
516 J Operations Rpseare

Example 10 : Suggest optimum solution to the following assignment problem and

also the maximum sales :
Salesmen Markets (Sales in Lakhs Rs.)
I II III IV
A 44 80 52 60
B 60 56 40 72
C 36 60 48 48
D 52 76 36 40
[UP TECH MBA 2006-07]
Solution : This is a maximization assignment problem. Placing negative sign
before each elem,ent of the given matrix, the corresponding loss (or minimization)
assignment problem is given by
I II III IV
A — 44 — 80 — 52 — 60
B — 60 — 56 — 40 —72
C — 36 — 60 — 48 — 48
D —52 —76 —36 —40
Step 1 and 2 : Subtracting the minimum element of each row from all the
elements of the corresponding row and then subtracting the minimum element
of each column from all the elements of the corresponding column, we get the
following matrix :
I II III IV
A 24 0 16 20
B 0 16 20 0
C 12 0 0 12
D 12 0 28 36
Step 3 : Giving zero assignments in the usual manner, we get the following matrix :

0
)[I III IV
A 24 16 20 I®
B 1-6 • .0 ;€4;
L2...c. 12 $ 0 12
D 12 28 36 ✓®
Assignment Problem 517

In the above table, we observe that the row IV and column IV has no zero
assignment. So we proceed to the next step.
Step 4 : Here we draw minimum number of lines (horizontal and vertical) to
cover all the zeros at least once. The number of such lines is three. See
table in step 3.
Step 5 : Since the smallest element among all uncovered elements in the above
table is 12, so subtracting 12 from all uncovered elements, adding it to
every element that lies at the intersection of ts4o lines and leaving
remaining elements unchanged, the above table reduces to the following
form :
II III IV
A 12 DI 4 8
B X 28 20 CI
C 12 12 0 12

D EI X 16 24

Step 6 : Giving zero assignment in the usual manner, in the table obtained in step
5, we observe that each row and each column has assignment.
Hence the required optimum solution is
A B —> IV, C —> D —> I
The maximum sales for the above assignments is
Rs. (80+72+48+52) = Rs. 252.
Example 11 : A company has four territories open, and four salesmen available for
assignment. The territories are not equally rich in their sales potential. It is estimated that
a typical salesman operating in each territory would bring in the following annual sales :

Territory I II III IV
Annual sales (Rs.) : 60000 50000 40000 30000

The four sales men are also considered to differ in ability; it is estimated that,
working under the same conditions their yearty sales would be proportionally as follows :

Salesmen : B C D
Proportion : 7 5 5 4

If the criterion is maximum expected total sales, the intuitive answer is to assign
the best salesman to the richest territory the next best salesman to the second richest,
and so on. Verify this answer by the assignment technique.
[Meerut 2004, 04 (0)]
Solution : To construct the effectiveness matrix.
The sum of proportions of sales of four salesmen
= 7+5+5+4 = 21
518 Operations Research
Taking the salesmen in the four territories, sales are as follows
7 7 7
for A, 2- x 6, — x3
21 21 21 21

for B, 5 x6, 5 x5, 5 x4, 5 x3

21 21 21 21
5
for C, — x 6,
5
— x 5,
5
— x 4,
21 21 21 21
5"

forD, 4 x6, 4 x5, 4 x4, -4-x3

21 21 21 21
To avoid fractions we consider the sales in 21 years which are as follows

for A, 42, 35, 28, 21

for B, 30, 25, 20, 15
for C, 30, 25,_ 20, 15
for D, 24, 20, 16, 12

Thus, the problem is to determine the assignments (of salesmen to territories)

which make the total sales maximum, and the effectiveness matrix is given by
I II III IV
A 42 35 28 21
B 30 25 20 15
C 30 25 20 15
D 24 20 16 12

To convert the maximization problem to a minimization problem.

This is a maximization problem. By multiplying each element of this matrix by -1,
it is converted to minimization problem. Thus, the resulting matrix is as follows :

I II III IV

A - 42 - 35 - 28 - 21

B -30 -25 -20 -15

C -30 -25 -20 -15

D -24 -20 -16 -12

Assignment Problem 519

Solution of the minimization problem.

Step 1, 2 and 3 : Applying step 1, 2 and 3 we obtain the following matrix.

L1 -

3 6 9
X 1, 2 3
* 1 2 3

D ....... L

Step 4 : Here only two lines (less than 4, the

L1
number of rows or columns in
matrix) cover all the zeros. So we
proceed to the next step.
5 8 /0
Step 5 : Subtracting 1, minimum of all 1 2 I CD
uncovered elements by the lines, from 1
* 2 I 0
all the elements through which no line
passes, adding to the elements which I YK El L3
lie at the intersection of two lines and
leaving other elements as they are,
we obtain, the following matrix.
Step Giving the zero assignments in '
matrix we see that there is no assignment in row 3 and column 4.
Therefore, we again proceed to draw minimum number of lines to cover
all zeros.
Step 7 : Proceeding in our usual manner we find that there are three lines
(minimum number) to cover all zeros (see table in step 5).
Step 8 : Now subtracting 1, the minimum of all uncovered elements by the lines,
from all the elements through which no line passes, adding to the
elements which lie at the intersection of two lines and leaving other
elements as they are, we get the following matrix.

0 2 4 7

0 0 0 1

0 0 0 1

2 1 0 0
520 Operations Research

Step 9 : Giving assignments in usual manner we get following two assignments.

I II III IV I II III IV
A O
Q 2 4 7
B X :6; 0 1

C x x 1

D 2 1 X 11

Thus, we get the following two optimal solutions (assignments).

(i) A I, B --> C —> D —> IV

and (ii) A —) I, B —> C —) D—>W

From both the solutions it is obvious that the best salesman A is assigned to the
richest territory I and the worst salesman D to the poorest territory [Link] salesmen B
and C are equal in efficiency, so either of them may be assigned to territories II and M.
This assignment verify the given problem.

13.7 Restrictions on Assignment

Sometimes due to some restrictions the assignment of a particular facility to a
particular job is not permitted. To overcome this difficulty a very high cost (infinite
cost) is assigned to the corresponding cell which automatically exclude this activity
from the optimal solution.
For clear understanding, see the following example.
Example 12 : Solve the following assignment problem :

I II III IV

A 9 11 15 10 11

B 12 9 10 9

C 11 14 11 7
14 8 12 7 8

[Meerut 2001 (BP)]

Solution : According to the given assignment table facility B cannot be assigned to
job III and the facility C cannot be assigned to job I, so we assign a very high cost in
the cells (B, III) and (C, I).
Also the matrix is not a square matrix i.e., it is a unbalanced assignment
problem, so we add a dummy facility E with zero costs in all cells of this row. Thus,
we get the following assignment table :
Assignment Problem 521

11 III IV V
A 9 15 10 11
B 12 9 00 10 9
C 11 14 11 7
D 14 8 12 7 8
E 0 0 0 0 0

Step 1 : Subtracting the minimum element of each row from every element of the
corresponding row and then subtracting the minimum element of each
column from every element of the corresponding column, the reduced
matrix is

I II III IV V

A 0 2 6 1 2

B 3 0 00 1 0

C 00 4 7 4 0

D 7 1 5 0 1

E 0 0 0 0 0

Step 2 : Giving zero assignment in the usual manner, we get the following matrix.

11 III IV V
A QO 2 1 2.

B 3 El 1 :€1;

C co 4 7 4 El
D 7 1 5 13 1

E X X X

Since there is an assignnient in each row and each column, so the optimal
assignment is
A-3 I, B --> C -3 V, D IV
Here the job HI remains undone.
•
522 Operations Research

+ Exercise on Chapter 13 +

1. Define assignment problem. [UP TECH MBA 2005-06]

2. Write short note on "Assignment problem". [Meerut 2008 (BP)]
3. Give an algorithm to solve an assignment problem. [Rohilkhand 2002]
4. Give a mathematical formulation of the assignment problem.
5. Show that an assignment problem does not change in structure if each
row or column is reduced by a constant. Explain how this property can be used
to find the solution of an assignment problem.
6. Show that if in an assignment problem, we add a constant to every element of
row (or column) in the effectiveness matrix, then an assignment that
minimizes the total effectiveness in one matrix also minimizes the total
effectiveness in the other matrix.
7. Give in detail the computational procedure of solving the assignment problem.
[Meerut 2000]
8. Explain Hungarian method for solving an assignment problem.
[UP TECH MBA 2001-02; Meerut 2001, 02 (BP), 03, 03 (P)]
9. There are five jobs to be assigned, one each to five machines and the associated
cost matrix is as follows :
Machine
'Job 1 2 3 4 5

• 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15

Solve the following minimal assignment problem.

[Meerut 1996 (P), 2001; Rohilkhand 1992]
10. Solve the following minimal assignment problem :
I II III IV

A 1 4 6 3
B 9 7 10 9 '
C 4 5 11 7
-D 8 7 8 5
[Meerut 2003]
Assignment Problem 523

11. Solve the following assignment problem.

Time (In minutes)
Works Job 1 Job 2 Job 3
A 4 2 -, 7
B 8 5 3
C 4 5 6
[UP TECH MBA 2001-02]
12. A computer centre has got three expert programmers. The centre needs three
application programmes to be developed. The head of the computer centre,
after studying carefully the programmes to be developed, estimates the
computer time in minutes repaired by the experts to the application
programmes as follows :
-- Programme
A B C
1 120 100 80
Programmer 2 70 90 110
3 110 140 120
Assign the programmers to the programmes in such a way that the total
computer time is least. [Meerut 2007; Agra 2003]
13. An automobile dealer wishes to put four repairmen to four different jobs. The
repairman have somewhat different kinds of skills and they exhibit different
levels of efficiency from one job to the another. The dealer has estimated the
number of man-hours that would be required for each job-man combination.
This is given in matrix form in the following table :
Job

ABCD
1 5 3 2 8
Man 2 7 9 2 6
3 6 4 5 7
4 5 7 7 8
Find the optimal assignment that will result in minimum man-hours needed.
[Rohilkhand 2002]
14. Find the optimal assignment for the problem with the following matrix :
1 11 111 W
5 3 1 8
B 7 9 2 6
C 6 4 5 7
D 5 7 7 6
524 Operations Research

15. Find the optimum solution to the assignment problem having the following
cost matrix :
Sales Territories
(Cost in rupees thousands)
I II III IV
A 30 25 26 28
Salesman B 26 32 24 20
20 22 18 27
D 23 20 21 19,
[Meerut 2002]
16. Solve the following assignment problem represented by the matrix :
I II HI IV V
A 6 5 8 11 16
B 1 13 16 1 10
C 16 11 8 8 8
D 9 14 12 10 16
E 10 13 11 8 16
[Rohilkhand 2001]
17. One car is available at each of the stations 1, 2, 3, 4, 5, 6, and one car is required
at each of the stations 7, 8, 9, 10, 11, 12. The distance between the various
stations are given in the matrix below. How should the cars be despatched so as
to minimize the total mileage travelled ?
7 8 9 10 11 12
1 42 72 39 52 25 51
2 22 29 49 65 81 50
3 27 39 60 51 32 32
4 45 50 48 52 37 43
5 29 40 39 26 30 33
6 82 40 40 60 51 30
18. Solve the following assignment problem.
Typist Job (Time)
P Q R S
A 85 50 30 40
B 90 40 70 45
C -- , 70 60 60 50
D 75 45 35 55
[UP TECH MBA 2002-03]
Assignment Problem 525
19. Consider the problem of assigning five jobs to five persons. The assignment
costs are given as follows :
Job
1 2 3 4 5
A 8 4 2 6 1
B 0 9 5 5 4
Person C 3 8 9 2 6
D 4 3 1 0 3
E 9 5 8 9 5
Determine the optimum assignment schedule. [Meerut 2006 (BP)]--
20. Solve the following minimal assignment problem.

Man 1 2 3 4 5
Job
12 8 7 15 14
// 7 9 17 14 10
III 9 6 12 6 7
IV 7 6 14 6 10
V 9 6 12 10 6

21. Solve the following minimal assignment problem.

1 2 3 4
A 10 12 19 11
B 5 10 7 8
C 12 14 13 11
D 8 15 11 9
22. Find the minimum cost solution for the 5 x 5 assignment problem whose
coefficients are as given below :
I/ III IV V
1 -2 -4 -8 -6 -1
2 0 -9 -5 -5 -4
3 -3 -8 -9 -2 -6
4 -4 -3 -1 0 -3
5 -9 -5 -8 -9 -5
526 Operations Research

23. Five men are available to do five different jobs. From past records, the time (in
hours) that each man takes to do each job is known and is given in the
following table.
Job
II III IV V
1 2 9 2 7 1
2 6 8 7 6 1
Man 3 4 6 5 3 1
4 4 2 7 3 1
5 5 3 9 5 1
Find the assignments of men to jobs that will minimize the total time taken.
24. A national truck-rental service has a surplus of one truck in each of the cities 1,
2, 3, 4, 5 and 6; and a deficit of one truck in each of the cities 7, 8, 9, 10, 11 and
12. The distances (in kilometers) between the cities with a surplus and the
cities with a deficit are displayed below :
To
7 8 9 10 11 12
1 31 62 29 42 15 41
2 12 \19 39 55 71 40
From 3 17 `29 50 41 22 22
4 35 40 38 42 27 33
5 19 30 29 16 20 23
6 72 30 - 30 50 41 20
..1••=1=

How should the trucks be dispersed so as to minimize the total distance

travelled ?
25. Six wagons are available at six stations A, B, C, D, E and F. These are acquired at
stations I, II, III, IV, V and VI. The mileage between various stations is given by
the following table
I II— III IV V VI
A 20 23 18 10 16- 20
B 50 20 17 16 15 11
C 60 30 40 55 8 7
D 6 7 10 20 100 9
E 18 19 28 17 60 70
F 9 10 20 30 40 55
How should the wagons be transported in order to minimize the total mileage
covered.
Assignment Problem 527

26. A car hire company has one car at each of five depots a, b, c, d and e. A customer
requires a car in each town namely A, B, C, D and E. Distances (in Kms.)
between depots (origins) and towns (destinations) are given in the-following,
distance matrix.
a b C d e

A 160 130 ' 175 190 200

135 120 130 160 175
B 140 110 155 170 185
D 50 50 80 80 110
E 54 34 70 80 105

How should cars be assigned to customers so as to minimize the diskance travelled ?

[IAS 1994]
27. Six men are available for six different jobs. From past records the time in hours
taken by different persons for different jobs are given below :
Jobs
Men 1 2 3 4 5 6
1 2 9 2 7 9 1
2 6 8 7 6 14 1
3 4 6 5 3 8 1
4 4 2 7 3 10 1
5 5 3 9 -5 -12 1
6 9 8 12 13 9 1

Find out an allocation of men to different jobs which will lead to minimum
operating time.
28. Solve the following assignment problem having the following cost matrix :
1 2 3 4 5 6 7
A 35 20 60 41 27 52 44
B 51 39 42 33 65 47 58
C 25 32 53 41 50 36 43
D 32 28 40 46 33 55 49
E 43 36 45 63 57 49 42
F 27 18 31 46 35 42 34
G 48 50 72 59 43 64 58
[Agra 1999]
528 Operations Research

29. Solve the following cost minimizing jobs problem :

Jobs
I II III IV V

A 11 10 18 5 9

14 13 12 19 6
Machine
5 3 4 2 4

D 15 18 17 9 12

E 10 11 19 6 14
[Delhi BSc (Maths) 1993]
30. Solve the following minimal assignment problem :

I II HI IV V

1 15 21 6 4 9

2 3 40 21 10 7

3 9 6 5 8 10

4 14 8 6 9 3

5 21 16 18 7 4

[Meerut 2005 (BP)]

31. An air-line that operates seven days a week has time-table shown below. Crews
must have a minimum layover of 5 hours between flights. Obtain the pairing of
flights that minimizes layover time away from home. For any given pairing the
crew will be based at the city that results in the smaller layover.

Delhi-Srinagar Srinagar-Delhi

Flight No. Departure Arrival Flight No. Departure Arrival

1 07.30 A.M. 09.00 A.M. 101 07.00 A.M. 10.00 A.M.
2 08.15 A.M. 09.45 A.M. 102 07.45 A.M. 10.45 A.M.
3 02.00 P.M. 03.30 P.M. 103 11.00 P.M. 02.00 P.M.
4 05.45 P.M. 07.15 P.M. 104 06.00 P.M. 09.00 P.M.
5 07.00 P.M. 08.30 P.M. 105 07.30 P.M. 10.30 P.M.

[Meerut 1994 (P), 96 (BP), 98, 98 (BP)]

Assignment Problem 529

32. Solve Q. No. 31, when the time-table is as follows and minimum layover time is
6 hours.

Delhi-Calcutta Calcutta-Delhi

Flight No. Departure Arrival Flight No. Departure Arrival

1 07.00 A.M. 09.00 A.M. 101 09.00 A.M. 11.00 A.M.
2 09.00 A.M. 11.00 A.M. 102 10.00 A.M. 12.00 Noon
3 01.30 P.M. 03.30 P.M. 103 03.30 P.M. 05.30 P.M.
4 07.30 P.M. 09.30 P.M. 104 08.00 P.M. 10.00 P.M.
[Meerut 1999]
33. XYZ airline operating 7 days a week has given the following time table. Crews
must have a minimum layover of 5 hours between flights. Obtain pairing flights
that minimizes layover time away from home. For any given pairing the crew
will be based at the city that results in the smaller layover :

Chennai-Mumbai Mumbai-Chennai

Flight No. Departure Arrival Flight No. Departure Arrival

Al 06.00 A.M. 08.00 A.M. Bi 08.00 A.M. 10.00 A.M.
A2 08.00 A.M. 10.00 A.M. B2 09.00 A.M. 11.00 A.M.
A3 02.00 P.M. 04.00 P.M. B3 02.00 P.M. 04.00 P.M.
A4 08.00 P.M. 10.00 P.M. B4 07.00 P.M. 09.00 P.M.

[C.A. (May) 2000]

34. Find the optimal assignment for the given assignment problem.
Machine

1 2 3
1 5 7 9
Job 2 14 10 12
3 15 13 16
[IAS (Maths) 1999]
35. Find the optimal solution for the assignment problem with the following cost
matrix.
II III IV V
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15
[IAS (Maths) 2000]
530 Operations Research

36. ABC company is engaged in manufacturing 5 brands of packed snacks. It is

having five manufacturing setups, each capable of manufacturing any of its
brands, one at a time. The cost to make a brand on these setups vary according
to the following table.
Si S2 S3 S4 "5
B1 4 6 7 5 11
B2 7 3 6 9 5
B3 8 5 4 6 9
B4 9 12 7 11 10
B5 7 5 9 8 11

Assuming five setups are S1, S2, 53 , S4, S 5 and five brands are B1, B2, B3,
B4,B5, find the optimum assignment of products on these setups resulting in
the minimum cost.'
[C.A. November 1998]
37. A Private firm employs typists on hourly piece rate basis for their daily work.
Five typists are working in that firm and their charges and speeds are different.
On the basis of some earlier understanding, one job is given to one typist and
the typist is paid for full hours even when he or she works for a fraction of an
hour. Find the least cost allocation for the following data:
Typist Rate per No. of Pages Job No. of Pages
hours (Rs.) typed per hour
A 5 12 P 199
B 6 14 Q 175
C 3 8 R 145
D 4N 10 S 298
E 4 11 T 178
[C.A. (Nov.) 1996i Delhi MBA Nov. 19961
Hint : Time taken (in hours) 'by typist A to do the job P, Q R, S, T are
respectively 199/12 =16.581 175/12 = 14.58, 145/12 = 12.08, 298/12 =
24.83, 178/12 = 14.83
When typist A do the job P, Q R, S, T then he will be paid for 17, 15, 13, 25,
15 hours respectively.
i.e., he will be paid
Rs. 5 x 17 = 85, 5 x 15 = 75, 5 x 13 = 65, 5 x 25 = 125, 5 x 15 = 75 respectively.
Similarly, payment to other typists can be calculated when they do the jobs
P. Q R, S or T.
Thus, the matrix giving the cost (in Rs.) incurred, if the i-th Typist (i = A, B, C,
D, E) do the j-th job ( j = P, Q R, S, T) is as follows :
Assignment Problem 531

Job
P Q R S T
A 85 .75 65 125 75
B 90 78 66 132 78
Typist C 75 66 57 114 69
D 80 72 60 120 72
E 76 64 56 112 68
Now solve by Hungarian Method.
38. A department head has four tasks to be performed and three subordinates. The
subordinates differ in efficiency.. The estimates of the 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
A 9 26 15
B 13 27 6
Tasks
35 20 15
D 18 30 20
39. Solve the following assignment problem :
I II III IV VI
A 12 10 15 22 18 8
B 10 18 25 15 16 12
C 11 10 3 8 5 9
6 14 10 13 13 12
E 8 12 11 7 13 10
[Meerut 2002]
40. Solve the following unbalanced assignment problem of minimizing total time
for doing all the jobs.
Job
1 2 3 4 5
1 6 2 5 2 6
2 2 5 8 7 7

3 7 8 6 9 8
Operator
4 6 2 3 4 5
5 9 3 8 9 0
6 4 7 5 6 8
532 Operations Research

41. Use the Hungarian Method to find which of the two jobs should be left undone
when each of the four persons will do only one job in the following cost
minimizing assignment problem.
Job

J3 J4 J5 JG

P1 10 9 11 12 8 5

P2 12 10 9 11 9 4
Person
P3 8 11 10 7 12 6

P4 10 7 8 10 10 5

[Meerut L.P. 1996]

42. A company has 4 machines to do 3 jobs. Each job can be assigned to one and
only one machine. The cost of each job on each machine is given in the
following table :
Machine

w X 1(

A 18 24 28 32

Job B 8 13 17 19

C 10 15 19 22

What are the job assignments whichl^:ill minimize the cost ?

[Gauhati MCA 1992]
43. There are 3 persons P1, P2 and P3 and 5 jobs Ji, Jz , J 5. Each persons can do
only one job and a job is to be done by one person only. Using Hungarian
method, find which 2 jobs should be left undone in the following cost
minimizing problem.

J1 "2 J3 J5

P1 7 8 6 5 9

P2 9 6 7 6 10

P3 8 7 5 6

[Meerut (LP) 1997, 98]

44. In a machine shop, a supervisor wishes to assign five jobs among six machines.
Any one of the jobs can be processed completely by any one of the machines as
given below :
Assignment Problem 533

Machines
A

1 13 13 16 23 19 9
2 11 19 26 16 17 18
Job 3 12 11 4 9 6 10

4 7 15 9 14 14 13
5 9 13 12 8 14 11
The assignment of jobs to machines be on a one to one basis. Assign the jobs to
machines so that the total is minimum. Find the minimum total cost.
[IAS (Maths) 1998]
45. A marketing manager has 5 salesmen and sales-districts. Considering the
capabilities of the salesmen and the nature of districts, the marketing manager
estimates that sales per month (in hundred rupees) for each salesman in each
district would be as follows :
Districts
A B C D E
1 32 38 40 28 40
Salesmen 2 40 24 28 21 36
3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 , 35 39
Find the assignment of salesman to districts that will result in maximum sales.
[UP TECH MBA 2005-06; Agra 1998; Meerut 2009 (BP)]
46. The owner of a small machine shop has four persons available to assign to jobs
for the day. Five jobs are offered with the expected profit in rupees for each
person on each job being as follows :
Job
A B C D E
1 6.20 7.80 5.00 10.10 8.20
2 7.10 8.40 6.10 7.30 5.90
Person
3 8.70 9.20 11.10 7.10 8.10

4 4.80 6.40 8.70 7.70 8.00

534 Operations Research
Find the assignments of persons to jobs that will result in a maximum profit.
Which job should be declined ? [Meerut 1995 (BP), 2006]
[Hint : Introduce 5th fictitious row with zero costs to make the unbalanced
problem to balanced one. Multiply each element by 10 to change the numbers
to complete numbers and also multiply each element by — 1 to change it to
minimization problem. Now proceed by Hungarian Method] .
47. A company is faced with the problem of assigning 4 machines to 6 different jobs
(one machine to one job only).The profits are estimated as follows :
Machines
Job A

1 3 6 2 - 6
2 7 1 4 4
3 3 8 5 8
4 6 4 3 7
5 5 2 4 3
6 5 7 6 4
Solve the problem to maximize the total profits.
[Hint : Change the problem to minimization assignment problem by
multiplying each element by — 1, then change the unbalanced assignment
problem to balanced one by adding two more columns with zero costs.]
48. A manufacturing company has four zones A, B, C, D, and four sales engineers P,
Q R, S respectively for assignment. Since the zones are not equally rich in sales
potential, it is estimated that a particular engineer operating in a particular
zone will bring the following sales.
Zone A 420000
Zone B 336000
Zond C 294000
Zone D 462000
The engineers are having different sales ability. Working under the same
conditions, their yearly sales are proportional to 14,'9, 11 and 8 respectively.
The criteria of maximum expected total sales is to be met by assigning the best
engineer to the richest zone, the next best to the second richest zone and so on.
Find the optimum assignment and maximum sales.
[CA (May) 1998]
[Hint : Proceed similarly as in Ex. 11]
49. A company has five jobs to be done. The following matrix shows the return in
Rs. assigning i-th (i = 1, 2, ..., 5) machine to the j-th job (j = 1, 2, ..., 5). Assign
the five jobs to the five machines so as to maximize the total return.
Assignment Problem 535

Job/Machine 1 4 52 3
1 5 11 10 12 4
2 2 4 6 3 5
3 3 12 5 14 6
4 6 14 4 11 7
5 7 9 8 12 5
[Meerut 2010; Agra 2002]
50. Four engineers are available to design four projects. Engineer 2 is not
competent to design the project B. Given the following time estimates needed
to each engineer to design a given project, find how should the engineers be
assigned to projects so as to minimise the total design time projects.
Project
A D
1 12 10 10 8
2 14 Not suitable 15 11
Engineer
3 6 10 16 4
4 8 10 9 7
51. Four engineers are available to design four projects. Engineer 2 is not
competent to design the project B. Given the following time estimates needed
to each engineer to design a given project, find how should the engineers be
assigned to projects so as to minimise the total design time of four projects.
Project
A D
1 16 14 14 12
2 16 17 13
Engineer
3 11 15 21 9
4 8 10 9 7
[Meerut 1996]
52. Five operators have to be assigned to five machines. The assignment costs are
given in the table below :
Machine
I II III IV V
A 5 5 — 2 6
B 7 4 2 3 4
Operator C 9 3 5 — 3
D 7 2 6 7 2
E 6 5 7 9 1
Operator A cannot operate machine III and operator C cannot operate machine
IV. Find the optimal assignment schedule.
536 Operations Research
53. The Secretary of a school is taking bids on the city's four school bus routes. Four
companies have made the bids as detailed in the following table.
Bids
Company Route 1 Route 2 Route 3 Route 4
1 Rs. 4000 Rs. 5000 - -
2 -- Rs. 4000 - Rs. 4000
3 Rs. 3000 - Rs. 2000 -
4 - - Rs. 4000 Rs, 5000
Suppose each bidder can be assigned only one route. Use the assignment
model to minimize the school's cost of running the four bus routes.
[C.A. Nov. 1995]
•

+ ANSWERS +
9. Job --> Machine : A->1,B-> 4, C -> 5, D -› 3, E-4 2. = 60
10. A -> B -> C- > D > IV
11. A-> Job 2, B -4 Job 3, C-> Job 1. Mini. Time = 9 min.
12. Programmer -> Programme : 1- C, 2 -> B, 3 --> A. Mini. Time = 280m
13. Man-*Job: 1-*B, 2->C, 3->D, 4->A
or 1 —> 2 ->13, 3 -> B, 4 -> A
Mini. Time = 17 h
14. A -> III, B /V, C II, D -> I. Mini. Cost = 16
15. Sales man --> Territory : A -->
or A -> B -> IV, CSI,D-->II
In both cases mini. cost = 86
16. A -->gB-41, C ->
or A— > IV, C —> V, D
Mini. Cost = 34
17. Station -> Station : 1 -> 11, 2 --> 8, 3 -> 7, 4 --> 9, 5 10, 6 --> 12
Mini. Mil = 185
18. A->S,B->Q,C->P,D->R
19. Person -÷ Job : A -> 5, B1,C---) 4, D 3, E--> 2. Mini. Cost = 9
20. Job --> Man : --> 3, 1, HI -> 2, IV-> 4, V -> 5
or 3, H 1,III-44,1V-->2,V—> 5
21. A —> 2, B —> 3, 4, D —> 1. Min. Cost = 38
Assignment Problem 537

22. 1 -> III, 2-> 11, 3 -> V, 4 ->/, 5 /Vorl-->/1,:, 2->//, 3-->///, 4->V, 5-4/
Mini. Cost = 36
23. Man --> Job : 1 ---> III, 2 -> V, 3 -> I, 4 -> IV, 5>II
or
or I> /II, 2 -> V, 3>1V, 4 -9 1, 5 -4 11
24. 1->11, 2-98, 3-> 7, 4-> 9,5-910, 6-->12
Mini. Distance = 125 kms
25. AIV,B->V1,C->V,D-->III,E->l,F-H
Mini. T. Mileage = 66
26. Depot -4 customer : a ---> D, b > C, C--4 B, d > E, e > A
Mini. Dist. = 570 kms
27. Man-9 Job: 1-43, 2->6,3 4 6->5
Or 1 ->3, 2-96, 3-94, 4->2, 5 1, 6--45
Mini. time = 22 units
28. A.-92,13 -> 4,C-> 6,D-> 1,E7,F-> 3, G ->5
MM. Cost = 237 units
29. Machine -4 Job : A --> II, B --> V, C--> III, D > IV, E -->I
Mini. Cost = 39
30. 1--->/V, 2 4-9111, 5->V
32. 1 ---> 103, 2 ->104, 3 -> 101, 4 -9 103
Crew at Delhi Delhi Delhi Calcutta
33. Al -4 B3 A2 -> B4, A3 -4 B1, A4 B2
Mini. Layover time = 40 hours
34. Job -> Machine : 1 -9 1, 2 -> 3, 3 -> 2
35. A -> I, B --> IV, C -> V, D --> HI, E -> II
Mini. Cost = 60
36. -> St, B2 55, B3 -> S4, B4 S3,B5 -> S2
Mini. Cost = 27
37. Typist --> Job : A T, B -> R, Q, D -> P, E--> S
T. Mini. Cost = Rs. 399
38. Task -> Man : A -> 1, B-> 3, C --> 2
Task D is undone, mini. total man hours = 35
39. A -> not assigned
40. Operator -> Job : 1 -> 4, 2 --> 1, 4 -4 2, 5 -> 5, 6 > 3
Operator 3 do not job. Mini. total time = 11 units
538 Operations Research

41. Person —> Job : P1 —> J5,P2 —> J6, P3 —> J4,P4, —> J2
Jobs J1 and J3 are left undone
42. Job —> Machine :A--)W,BX,C-->YorA—>W,BY,CX
In both cases no job is assigned to machine Z
43. Person Job : P1 J3, P2 12,P3 —> J4; Jobs Ji and J5 left undone
or P1 —> J4,P2 J2,P3 —> J5; Jobs J1 and J3 left undone
In both cases minimum cost is 17
44. Job Machine : 1 —> F, 2 —> A, 3 —> E, 4 —> C, 5 D
Mini. Cost = 43
45. Salesman —> District : 1 B, 2 —> A, 3 —> E, 4 —> C, 5 D
Max. Sales = Rs. 19100
46. Person —> Job : 1 —> D, 2 ---> B, 3 C,.4 E
Job A should be declined
47. Job —> Machine : 2 A, 3 —> B, 4 —> D, 6 —> C
Jobs 1 and 5 are left undone. Max. Profit = 28 units
48. Engineer —> Zone : P —> D, Q —> B, R A, S —> C
Max. Sales = 392000 units
49. Job Machine : 1-* 5, 2 4, 3 1, 4 —> 3, 5 —> 2
Max. Return = 23 units
50. Engineer —> Project : 1—> B, 2 —>D, 3 A, 4 —> C •
Mini. total time = 36 hours
51. Engineer —> Project : 1-* B, 2 —> D, 3 --> A, 4 C
Mini. total time = 47 hours
52. Operator —> Machine (i) A —> IV, B III, C —> II, D EV
or (ii) A -->
or (iii) A ----> IV, B —> C V, D E —> I
53. Company-Route : 1- 1, 2 —> 2, 3 —> 3, 4 —> 4
Mini. Cost = Rs. 15000

• • •