MBA 2019-21 BATCH

SEMESTER III
GC 302 DECISION SCIENCE
UNIT 1.2.3: ASSIGNMENT

Dr. Yogesh W Bhowte

MODELS

1 By Dr.Yogesh W Bhowte
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Hungarian Method of assignment problem
B) Special cases in Assignment Problem:
3) Maximization Problem:

Dr. Yogesh W Bhowte

Following additional steps to be followed for maximization
problem to be solved thorough Hungarian Method
 Covert the profit matrix into loss matrix or opportunity
cost matrix by subtracting all its elements from the largest
element (including itself)
 Construct the new matrix and solve it as like minimization
assignment problem.

2
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Hungarian Method of assignment problem
Qu.5) Solve the following problem of maximization of
production output, based on the given data of production of

Dr. Yogesh W Bhowte

an article by given operators and machines
Machines
A B C D
Opera 1 10 5 7 8
tors 2 11 4 9 10
3 8 4 9 7
4 7 5 6 4
5 8 9 7 5
3
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: As the given matrix is an imbalanced one we need
to introduce a dummy column showing dummy machine E
with zero costs as given below:

Dr. Yogesh W Bhowte

Machines
A B C D E
Operato 1 10 5 7 8 0
rs
2 11 4 9 10 0
3 8 4 9 7 0
4 7 5 6 4 0
5 8 9 7 5 0 4
 302 DECISION SCIENCE:
UNIT 1.2.3:ASSIGNMENT MODELS
Solution: As the given problem is of maximization we have to
convert the matrix into loss matrix by deducting each
element from the highest as below:

Dr. Yogesh W Bhowte

Machines
A B C D E
Operator 1 11-10 11-5 11-7 11-8 11-0
s
2 11-11 11-4 11-9 11-10 11-0
3 11-8 11-4 11-9 11-7 11-0
4 11-7 11-5 11-6 11-4 11-0
5 11-8 11-9 11-7 11-5 11-0 5
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: And the new matrix is:

Machines

Dr. Yogesh W Bhowte

A B C D E
Operator 1 1 6 4 3 11
s
2 0 7 2 1 11
3 3 7 2 4 11
4 4 6 5 7 11
5 3 2 4 6 11
6
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: Step1: Find the smallest element of each row: Row
minima and deduct it from each element of the row

Dr. Yogesh W Bhowte

A B C D E Row
Minima
1 1-1= 0 6-1=5 4-1=3 3-1=2 11-1=10 1
2 0 7 2 1 11 0
3 3-2=1 7-2=5 2-2=0 4-2=2 11-2=9 2
4 4-4=0 6-4=2 5-4=1 7=4=3 11-4=7 4
5 3-2=1 2-2=0 4-2=2 6-2=4 11-2=9 2
7
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Step2: The New Matrix:

A B C D E

Dr. Yogesh W Bhowte

1 0 5 3 2 10

2 0 7 2 1 11

3 1 5 0 2 9

4 0 2 1 3 7

5 1 0 2 4 9 8
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Step3: Find the smallest element of each column: Column
minima and subtract it from each element of the column

Dr. Yogesh W Bhowte

A B C D E
1 0 5 3 2-2=1 10-7=3
2 0 7 2 1-1=0 11-7=4
3 1 5 0 2-1=1 9-7=2
4 0 2 1 3-1=2 7-7=0
5 1 0 2 4-1=3 9-7=2
Column 0 0 0 1 7
Minima 9
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
The New Matrix.
Step5: Draw minimum vertical and horizontal lines covering
all zeros of the matrix. As no of lines = no of rows /columns
the solution is optimum.

Dr. Yogesh W Bhowte

A B C D E
1 0 5 3 1 3
2 0 7 2 0 4 L2
3 1 5 0 1 2 L4
4 0 2 1 2 0 L3
5 1 0 2 3 2
L1 L5 10
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
The new Matrix and the allocations

A B C D E

Dr. Yogesh W Bhowte

1 0 5 3 1 3
2 0 7 2 0
0 4
3 1 5 0
0 1 2
4 0 2 1 2 00
5 1 2 3 2
0

11
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
The optimum solution is as follows:

The optimum production

Dr. Yogesh W Bhowte

Operator Machine Production
1 A 10
2 D 10
3 C 9
4 Dummy 0
5 B 9
Maximum Total 38

12
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
 Prohibited Assignment
Some times an operator or machine cannot perform a

Dr. Yogesh W Bhowte

particular job in such cases it is necessary to prohibit the
assignment of the unsuitable job to that machine or
operator , in such case in that particular cell the cross
mark or dash being put to indicate the prohibition of the
assignment.
While solving such assignment problem we put the
infinity (∞) sign in that cell and solve the problem

13
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Prohibited Assignments
Qu.6) There are 4 clerks and 4 tasks. The time (Hrs.) required
to complete the task is given in the below given matrix.

Dr. Yogesh W Bhowte

Clerk 2 cannot be assigned the task A and Clerk 3caanot be
assigned task B Find the optimum assignment schedule
Tasks
A B C D
Cle 1 4 7 8 6
rks 2 ---- 8 7 4
3 3 ….. 8 3
4 6 6 4 2
14
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution 6: Step1: Put the ∞ sign at prohibited cell and then
find the smallest element of each row: Row minima

Tasks Row

Dr. Yogesh W Bhowte

Minima
A B C D
Cler 1 4 7 8 6 4
ks 2 ∞ 8 7 4 4
3 3 ∞ 8 3 3
4 6 6 4 2 2

15
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution4 : 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. Yogesh W Bhowte

Tasks Row
Minima
A B C D
Cl 1 4-4=0 7-4=3 8-4=4 6-4=2 4
er 2 ∞ 8-4=4 7-4=3 4-4=0 4
ks
3 3-3=0 ∞ 8-3=5 3-3=0 3
4 6-2=4 6-2=4 4-2=2 2-2=0 2
16
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: The New Matrix:

Tasks

Dr. Yogesh W Bhowte

A B C D
Clerk 1 0 3 4 2
s
2 ∞ 4 3 0
3 0 ∞ 5 0
4 4 4 2 0

17
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
 Solution: Step3: Find the smallest element of each column:
Column minima and deduct it from the rest of the elements
of that column

Dr. Yogesh W Bhowte

A B C D
1 0 3-3=0 4-2=2 2
2 ∞ 4-3=1 3-2=1 0
3 0 ∞ 5-2=3 0
4 4 4-3=1 2-2=0 0
Column Minima 0 3 2 0

18
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: New Matrix:

A B C D

Dr. Yogesh W Bhowte

1 0 0 2 2

2 ∞ 1 1 0

3 0 ∞ 3 0

4 4 1 0 0 19
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: Step5: Draw minimum vertical and horizontal lines
covering all zeros of the matrix.

Dr. Yogesh W Bhowte

A B C D

1 0 0 2 2 L3
2 ∞ 1 1 0
3 0 ∞ 3 0
4 4 1 0 0 L4
L2 L1
20
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: Step6: As the number of lines= 4 = number of
rows/column. So the solution is optimum.
7: Make the assignments:

Dr. Yogesh W Bhowte

Find a row with single zero, mark that zero by (a square), cut
the remaining zeros in the column where assignment is
made.

21
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution4 : Make the assignments:

Dr. Yogesh W Bhowte

A B C D

1 0 0 2 2
2 ∞ 1 1 0
3 0 ∞ 3 0
4 4 1 0 0

22
 302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
 Solution: The minimum total time in minutes is computed as

Optimum Solution

Dr. Yogesh W Bhowte

Clerk Task Time
1 B 7
2 D 4
3 A 3
4 C 4
Total Minimum time 18 Hrs.

 End of 2nd Lecture on Assignment Model 23