Professional Documents
Culture Documents
Mba 19 Pat 302 Ds Unit 1.2.3
Mba 19 Pat 302 Ds Unit 1.2.3
SEMESTER III
GC 302 DECISION SCIENCE
UNIT 1.2.3: ASSIGNMENT
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
Machines
A B C D E
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
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.
A B C D E
11
302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
The optimum solution is as follows:
12
302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Prohibited Assignment
Some times an operator or machine cannot perform a
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.
Tasks Row
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.
Tasks
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
18
302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution: New Matrix:
A B C D
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.
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:
21
302 DECISION SCIENCE:
UNIT 1.2.3: ASSIGNMENT MODELS
Solution4 : Make the assignments:
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