MBA 2019-21 BATCH

SEMESTER III
GC 302 DECISION SCIENCE
UNIT 1.2.1: ASSIGNMENT MODELS

1 By Dr. Bhagyashree S. Kunte

 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
I) Introduction:
 Assignment Model is an optimization model as like LPP and
Transportation Model.
 It is useful for a situation where certain number of tasks is to
be assigned to similar number of facilities.
 Assignment problem arises in a variety of business situations
like: Assigning jobs to machines, assigning salesmen to sales
territories, assigning task to employees, and assigning taxis
to customers.
 It is a peculiar case of transportation problem where in the
number of sources and number of destinations is equal.
2
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
I) Introduction:
 The matrix is a square matrix in case of assignment problem
if it is not first step is to make it a square matrix, ie number
of rows are equal to number of columns in the assignment
problem.
 Although assignment problem can be solved either by using
the techniques of Linear Programming or by the
transportation method yet the assignment method developed
by D. Konig, a Hungarian mathematician known as the
Hungarian method of assignment problem is much faster
and efficient.
3
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
I) Introduction:
 The matrix is a square matrix in case of assignment problem;
if it is not first step is to make it a square matrix, ie number

Dr. Bhagyashree S Kunte

of rows are equal to number of columns in the assignment
problem.
 Although assignment problem can be solved either by using
the techniques of Linear Programming or by the
transportation method yet the assignment method developed
by D. Konig, a Hungarian mathematician known as the
Hungarian method of assignment problem is much faster
and efficient.

4
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS

II) Assignment Models:

The assignment problem can be solved by the following four
methods:
a)      Complete enumeration method:
b)      Simplex Method
c)      Transportation method
d)      Hungarian method

5
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
III) Hungarian Method of assignment problem solution:
The Hungarian method of assignment provides us with an
efficient means of finding the optimal solution. It is also

Dr. Bhagyashree S Kunte

called as “Flood’s Technique”. It is based on the concept of
opportunity cost.
IV) Steps in Hungarian Method (Balanced problem)
1: Find the smallest element of each row: Row minima
2: Subtract the smallest element from each of the other
elements of the row. [Complete this process for all rows] and
reframe the matrix with the new values of each cell.
3. Find the smallest element of each column: Column minima
6
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
IV) Steps in Hungarian Method
4: Subtract the smallest element from each of the other
elements of the column. [Complete this process for all
column] and reframe the matrix with the new values of each
cell.
5: Draw minimum vertical and horizontal lines covering all
zeros of the matrix.
6: If the number of lines is equal to the number of rows/
columns, then the solution is optimum and then move to the
next step 7.
If number of lines is not equal to number of rows/ column then
the solution is not optimum in that case go to step 8
7
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
IV) Steps in Hungarian Method
7: Make the assignments:
Find a row with single zero, mark that zero by (a square), cut
the remaining zeros in the column where assignment is
made. Examine the rows one by one and complete the
process of selecting the single uncovered zero and cancelling
the remaining zeros of the subsequent columns.
Follow the process for columns. And repeat the process till all
zeros of the matrix, are marked or cancelled/ cut. And get
the optimum solution.

8
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
IV) Steps in Hungarian Method
8: If the solution is not optimum then follow following step:
 Select the smallest uncovered element of the matrix.

 Deduct the smallest selected element from each of the

uncovered element
 Add the smallest selected element to each element at the
intersection of the lines
 Form a new matrix with new elements derived from above
process.
 Then go to step 5 and find for optimum solution.

9
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Examples of Assignment problems
A) Balanced Assignment Problem: with n rows and n
columns
Qu.1) A plant manager has four subordinates, and four tasks to
be performed. The subordinates differ in efficiency and the
tasks differ in their intrinsic difficulty. This estimate of the
times each man would take to perform each task is given in
below.
  I II III IV
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10 10
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Qu.1) How should the tasks be allocated, one to a man, so as
to minimize the total man hours?
Solution: Step1: Find the smallest element of each row: Row
minima

  I II III IV Row
Minima
A 8 26 17 11 8
B 13 28 4 26 4
C 38 19 18 15 15
D 19 26 24 10 10
11
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step2: Subtract the smallest element from each of the other
elements of the row. [Complete this process for all rows] and
reframe the matrix with the new values of each cell.

  I II III IV
A 8-8=0 26-8= 18 17-8=9 11-8= 3

B 13-4=9 28-4=24 4-4=0 26-4=22

C 38-15=23 19-15= 4 18-15=3 15-15=0

D 19-10=9 26-10=16 24-10=14 10-10=0

12
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step2: The New Matrix:

I II III IV

Dr. Bhagyashree S Kunte

A 0 18 9 3

B 9 24 0 22

C 23 4 3 0

D 9 16 14 0

13
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step3: Find the smallest element of each column: Column
minima
I II III IV

Dr. Bhagyashree S Kunte

A 0 18 9 3
B 9 24 0 22
C 23 4 3 0

D 9 16 14 0

Column 0 4 0 0
Minima
14
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step4: Subtract the smallest element from each of the other
elements of the column. [Complete this process for all
column] and reframe the matrix with the new values of each
cell.

Dr. Bhagyashree S Kunte

I II III IV
A 0 18-4=14 9 3
B 9 24-4=20 0 22
C 23 4-4=0 3 0
D 9 16-4=12 14 0

15
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
New Matrix:
I II III IV

Dr. Bhagyashree S Kunte

A 0 14 9 3

B 9 20 0 22

C 23 0 3 0

D 9 12 14 0

16
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step5: Draw minimum vertical and horizontal lines covering
all zeros of the matrix.
I II III IV

Dr. Bhagyashree S Kunte

A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0
L2 L3 L4 L1

17
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Step6: If the number of lines is equal to the number of rows/
columns, then the solution is optimum and then move to the
next step 7. Number of lines= 4 and number of rows/column
=4 So the solution is optimum

Dr. Bhagyashree S Kunte

Step 7: Make the assignments:
Find a row with single zero, mark that zero by (a square), cut
the remaining zeros in the column where assignment is
made. Examine the rows one by one and complete the
process of selecting the single uncovered zero and cancelling
the remaining zeros of the subsequent columns.
Follow the process for columns. And repeat the process till all
zeros of the matrix, are marked or cancelled/ cut. And get
the optimum solution. 18
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
I II III IV
A 0 14 9 3
B 9 20 0 22

Dr. Bhagyashree S Kunte

C 23 0 3 0
D 9 12 14 0
The minimum total man hours are computed as
Optimal assignment Man hours
A :: I 8
B ::III 4
C :: II 19
D ::IV 10
Total 41 hours 19
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Qu.2) A dairy plant has five milk tankers I, II, III, IV & V.
These milk tankers are to be used on five delivery routes A,
B, C, D, and E. The distances (in km.) between dairy plant
and the delivery routes are given in the following distance

Dr. Bhagyashree S Kunte

matrix
  I II III IV V
A 160 130 175 190 200
B 135 120 130 160 175
C 140 110 155 170 185
D 50 50 80 80 110
E 55 35 70 80 105

20
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Qu.2) How the milk tankers should be assigned to the chilling
centres so as to minimize the distance travelled?
Solution: Step1: Find the smallest element of each row: Row
minima

Dr. Bhagyashree S Kunte

  I II III IV V Row
Minima
A 160 130 175 190 200 130
B 135 120 130 160 175 120
C 140 110 155 170 185 110
D 50 50 80 80 110 50
E 55 35 70 80 105 35
21
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: Step2: Subtract the smallest element from each of
the other elements of the row. [Complete this process for all
rows] and reframe the matrix with the new values of each
cell.

Dr. Bhagyashree S Kunte

  I II III IV V Row Minima
A 160-130 130-130 175-130 190-130 200-130 = 130
= 30 =0 =45 = 60 70
B 135-120 120-120 130-120 160-120 = 175-120 = 120
=15 = 0 = 10 40 55
C 140-110 110-110 155- 170- 110 185-110 = 110
=30 =0 110 = 45 = 60 75
D 50 -50 = 50 -50 = 80- 50 = 80 – 50 = 110- 50 = 50
0 0 30 30 60
E 55 -35 = 35- 35 = 70-35= 80-35= 45 105-35 = 35
20 0 35 70 22
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: The New Matrix:

I II III IV V

Dr. Bhagyashree S Kunte

A 30 0 45 60 70
B 15 0 10 40 55
C 30 0 45 60 75
D 0 0 30 30 60
E 20 0 35 45 70

23
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
 Solution: Step3: Find the smallest element of each column:
Column minima
I II III IV V

Dr. Bhagyashree S Kunte

A 30 0 45 60 70
B 15 0 10 40 55
C 30 0 45 60 75
D 0 0 30 30 60
E 20 0 35 45 70
Column Minima 0 0 10 30 55

24
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
 Solution: Step4: Subtract the smallest element from each of
the other elements of the column. [Complete this process for
all column] and reframe the matrix with the new values of
each cell.

Dr. Bhagyashree S Kunte

I II III IV V
A 30 0 45-10= 35 60-30=30 70-55=15
B 15 0 10-10= 0 40-30=10 55-55=0
C 30 0 45-10= 35 60-30=30 75-55=20
D 0 0 30-10=20 30-30=0 60-55=5
E 20 0 35-10= 25 45-30=15 70-55= 15
Column 0 0 10 30 55
Minima 25
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: New Matrix:

I II III IV V

Dr. Bhagyashree S Kunte

A 30 0 35 30 15
B 15 0 0 10 0
C 30 0 35 30 20
D 0 0 20 0 5
E 20 0 25 15 15

26
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: Step5: Draw minimum vertical and horizontal lines
covering all zeros of the matrix.
I II III IV V

Dr. Bhagyashree S Kunte

A 30 0 35 30 15
B 15 0 0 10 0 L2
C 30 0 35 30 20
D 0 0 20 0 5 L3
E 20 0 25 15 15
L1

27
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution:
Step6: If the number of lines is equal to the number of rows/
columns, then the solution is optimum and then move to the next
step 7 else go to step 8

Dr. Bhagyashree S Kunte

Number of lines= 3 and number of rows/column =5; So the solution
is not optimum
Step 8: If the solution is not optimum then follow following steps:
 Select the smallest uncovered element of the matrix.
 Deduct the smallest selected element from each of the uncovered
element
 Add the smallest selected element to each element at the
intersection of the lines
 Form a new matrix with new elements derived from above
process. 28
 Then go to step 5 and find for optimum solution.
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: Smallest uncovered element in the above matrix =
15
I II III IV V

Dr. Bhagyashree S Kunte

A 30-15= 0 35-15=20 30-15=15 15-15=0
15
B 15 0+15=15 0 10 0
L2
C 30- 0 35-15=20 30-15=15 20-15=5
15=15
D 0 0+15=15 20 0 5
L3
E 20-15=5 0 25-15=10 15-15=0 15-15=0
29
L1
 302 DECISION SCIENCE:
UNIT 1.2: ASSIGNMENT MODELS
Solution: New Matrix:

I II III IV V

Dr. Bhagyashree S Kunte

A 15 0 20 15 0
B 15 15 0 10 0
C 15 0 20 15 5
D 0 15 20 0 5
E 5 0 10 0 0

30
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
 Solution: Step5: Draw minimum vertical and horizontal
lines covering all zeros of the matrix.

I II III IV V

Dr. Bhagyashree S Kunte

A 15 0 20 15 0 L5
B 15 15 0 10 0 L4
C 15 0 20 15 5
D 0 15 20 0 5 L3
E 5 0 10 0 0 L1
L2
31
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
Solution: Step 6: As no of lines= no of rows/ column; the
solution is optimum
Step 7: Make the assignments:
Find a row with single zero, mark that zero by (a square),

Dr. Bhagyashree S Kunte

cut the remaining zeros in the column where assignment is
made. Examine the rows one by one and complete the
process of selecting the single uncovered zero and cancelling
the remaining zeros of the subsequent columns.
Follow the process for columns. And repeat the process till all
zeros of the matrix, are marked or cancelled/ cut. And get
the optimum solution.

32
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
 Solution: The Optimum Solution

I II III IV V

Dr. Bhagyashree S Kunte

A 15 0 20 15 0
B 15 15 0 10 0
C 0 20 15 5
15
D 00 15 20 0 5

E 5 0 0
10 0
33
 302 DECISION SCIENCE:
UNIT 1.2.1: ASSIGNMENT MODELS
 Solution: The minimum total Kilometres are computed as

Dr. Bhagyashree S Kunte

Optimal assignment
A :: V 200
B ::III 130
C :: II 110
D :: I 50
E ::IV 80
Total 570 Km.

 End of 1st Lecture on Assignment Model 34