Assignment Problem

Hungarian Method

Slide 1 of 27
 Hungarian Method

Initial Table Row Min

Person Project
1 2 3
Adams 11 14 6
Brown 8 10 11

Cooper 9 12 7
Col Min
Slide 2 of 27
 Hungarian Method
Row Reduction
Person Project
1 2 3
Adams 5 8 0
Brown 0 2 3
Cooper 2 5 0

Slide 3 of 27
 Hungarian Method
Column Reduction
Person Project
1 2 3
Adams 5 6 0

Brown 0 0 3

Cooper 2 3 0

Slide 4 of 27
 Hungarian Method
Covering
Testing Line 2

Person Project
1 2 3
Adams 5 6 0
Brown Coverin
0 0 3 g Line 1

Cooper 2 3 0

Slide 5 of 27
 Hungarian Method
Revised Opportunity Cost Table
Person Project
1 2 3
Adams 3 4 0

Brown 0 0 5

Cooper 0 1 0

Slide 6 of 27
 Hungarian Method
Testing
Covering Covering Line
Person Line 1 Project 3
1 2 3
Adams
3 4 0
Brown Covering
0 0 5 Line 2
Cooper
0 1 0

Slide 7 of 27
 Hungarian Method
Assignments
Person Project
1 2 3
Adams 6

Brown 10

Cooper 9

Slide 8 of 27
2 Distance Minimization

Deficit cities
Surplus
Cities
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

Slide 9 of 27
 Deficit cities Deficit cities
Surplus I II III IV V Surplus I II III IV V
Cities Cities
A 160 130 175 190 200 A 30 0 45 60 70
B 135 120 130 160 175 B 15 0 10 40 55
C 140 110 155 170 185 C 30 0 45 60 75
D 50 50 80 80 110 D 0 0 30 30 60
E 55 35 70 80 105 E 20 0 35 45 70

Deficit cities Deficit cities

Surplus I II III IV V Surplus
Cities I II III IV V
Cities
A 30 0 35 30 15 A 30 0 35 30 15
B 15 0 0 10 0 B 15 0 0 10 0
C 30 0 35 30 20 C 30 0 35 30 20
D 0 0 20 0 5 D 0 0 20 0 5
E 20 0 25 15 15 E 20 0 25 15 15

Slide 10 of 27
 Deficit cities Deficit cities
Surplus I II III IV V Surplus I II III IV V
Cities Cities
A 30 0 35 30 15 A 30 0 35 30 15
B 15 0 0 10 0 B 15 0 0 10 0
C 30 0 35 30 20 C 30 0 35 30 20
D 0 0 20 0 5 D 0 0 20 0 5
E 20 0 25 15 15 E 20 0 25 15 15

Deficit cities
Surplus I II III IV V Surplus City Deficit City Distance (KMs
(KMs))
Cities A V 200
B III 130
A 15 0 20 15 0 C II 110
D I 50
B 15 15 0 10 0
E IV 80
C 15 0 20 15 5
Minimum Distance Travelled 570 Kms
D 0 15 20 0 5
E 5 0 10 0 0

Slide 11 of 27
 3 Cost Matrix
Profit Maximization
Machines Machines
Job Job I II III IV V
I II III IV V
A 30 37 40 28 40 A 32 25 22 34 22

B 40 24 27 21 36 B 22 38 35 41 26
C 40 32 33 30 35 C 22 30 29 32 27
D 28 38 40 36 36 D 37 24 22 26 26
E 29 62 41 34 39 E 33 0 21 28 23

Row Reduction Column Reduction

Machines
Machines Job I II III IV V
Job I II III IV V
A 10 3 0 8 0
A 10 3 0 12 0
B 0 16 13 15 4
B 0 16 13 19 4
C 0 8 7 6 5
C 0 8 7 10 5
D 12 2 0 0 4
D 12 2 0 4 4
E 33 0 21 24 23
E 33 0 21 28 23
Slide 12 of 27
 Machines Machines
Job I II III IV V Job I II III IV V
A 10 3 0 8 0 A 14 3 0 8 0
B 0 16 13 15 4 B 0 12 9 11 0
C 0 8 7 6 5 C 0 4 3 2 1
D 12 2 0 0 4 D 16 2 0 0 4
E 33 0 21 24 23 E 37 0 21 24 23

Job Machine Profit Original Matrix

A III 40
B V 36
C I 40 Machines
D IV 36 Job I II III IV V
E II 62
A 30 37 40 28 40
Maximum Profit 214
B 40 24 27 21 36
C 40 32 33 30 35
D 28 38 40 36 36
E 29 62 41 34 39

Slide 13 of 27
Unbalanced Problem- Cost Balanced Problem- Cost
Machines Machines
Job I II III IV V Job I II III IV V VI
A 6 2 5 2 6 A 6 2 5 2 6 0
B 2 5 8 7 7 B 2 5 8 7 7 0
C 7 8 6 9 8 C 7 8 6 9 8 0
D 6 2 3 4 5 D 6 2 3 4 5 0
E 9 3 8 9 7 E 9 3 8 9 7 0
F 4 7 4 6 8 F 4 7 4 6 8 0
Row Reduction
Machines
Machines
CR Job I II III IV V VI
Job I II III IV V VI
A 4 0 2 0 1 0
A 6 2 5 2 6 0
B 0 3 5 5 2 0
B 2 5 8 7 7 0
C 5 6 3 7 3 0
C 7 8 6 9 8 0
D 4 0 0 2 0 0
D 6 2 3 4 5 0
E 7 1 5 7 2 0
E 9 3 8 9 7 0
F 2 5 1 4 3 0
F 4 7 4 6 8 0
Slide 14 of 27
 Machines
Job I II III IV V VI Machines
Job I II III IV V VI
A 4 0 2 0 1 0
B 0 3 5 5 2 0 A 5 0 2 0 1 1
C 5 6 3 7 3 0 B 0 2 4 4 1 0
D 4 0 0 2 0 0 C 5 5 2 6 2 0
E 7 1 5 7 2 0 D 5 0 0 2 0 1
F 2 5 1 4 3 0 E 7 0 4 6 1 0
F 2 4 0 3 2 0
Original Cost Matrix
Machines
Job Machine Profit
A IV 2
Jo I II III IV V VI
B I 2 b
C VI 0 A 6 2 5 2 6 0
D V 5
E II 3 B 2 5 8 7 7 0
F III 4 C 7 8 6 9 8 0
D 6 2 3 4 5 0
Minimum Cost 16
E 9 3 8 9 7 0
F 4 7 4 6 8 0

Slide 15 of 27
 Unbalanced Maximization Unbalanced Cost Matrix

Job Job
Machi
ne A B V D E Machine A B C D E

1 49 33 61 0 29
1 62 78 50 111 82
2 40 27 50 38 52
2 71 84 61 73 59
3 24 19 0 40 30
3 87 92 111 71 81

4 48 64 87 77 80 4 63 47 24 34 31

Balanced Cost Matrix

Job Job
Machine Machine A B C D E

1 49 33 61 0 29 CR 1 49 33 61 0 29

2 40 27 50 38 52 2 40 27 50 38 52
3 24 19 0 40 30 3 24 19 0 40 30
4 63 47 24 34 31 4 63 47 24 34 31
5 0 0 0 0 0
5 0 0 0 0 0
Slide 16 of 27
 Job Job
Machine A B C D E Machine A B C D E

1 49 33 61 0 29 1 49 33 61 0 29

2 40 27 50 38 52 RR 2 13 0 23 11 25
3 24 19 0 40 30
3 24 19 0 40 30
4 39 23 0 10 7
4 63 47 24 34 31 5 0 0 0 0 0
5 0 0 0 0 0

Job Job
Machine A B C D E Machine A B C D E
1 49 33 61 0 29 1 42 26 61 0 22
2 13 0 23 11 25 2 13 0 30 18 25
3 24 19 0 40 30 3 17 12 0 40 23
4 39 23 0 10 7 4 32 16 0 10 0
5 0 0 0 0 0 5 0 0 7 7 0

Slide 17 of 27
 Job
Machine A B C D E Job
Machine
1 42 26 61 0 22 A B V D E
2 13 0 30 18 25
3 17 12 0 40 23 1 62 78 50 111 82
4 32 16 0 10 0 2 71 84 61 73 59
5 0 0 7 7 0 3 87 92 111 71 81
4 48 64 87 77 80

Machine Job Profit Original Matrix

1 D 111
2 B 84
3 C 111
4 E 80
5 A 0

Maximum Profit 386

Slide 18 of 27