Job Assignment

Applied Business Tools and Technology

An Introduction to Management Science
Quantitative Approaches to Decision Making
Anderson, Sweeney, Wiiliams, Camm, Cochran, Fry & Ohlmann
WHAT IS THE LOWEST COST
COMBINATION?
Employee A B C D E
Deok Sun 160 130 175 190 200
Taek 135 120 130 160 175
Sun-woo 140 110 155 170 185
Jung-hwan 50 50 80 80 110
Dong-ryong 55 55 70 80 105
STEPS IN CALCULATING FOR LEAST
COST (Hungarian Method)
1. Row Reduction / Operation
2. Column Reduction / Operation
3. Striking of Zeroes
If number of strikes is not optimal:
• Improvement
• Striking of zeroes
• Repeat improvement if number of strikes is not
optimal
4. Assigning of jobs
5. Computing optimal cost
3
1st Step
Row Reduction / Operation
Choose the lowest value and subtract it to all the
values in the row.
Employee A B C D E
Deok Sun 160 130 175 190 200
Taek 135 120 130 160 175
Sun-woo 140 110 155 170 185
Jung-hwan 50 50 80 80 110
Dong-ryong 55 55 70 80 105

4
1st Step
Row Reduction / Operation
Choose the lowest value and subtract it to all the
values in the row.
Employee A B C D E
Deok Sun 30 0 45 60 70
Taek 15 0 10 40 55
Sun-woo 30 0 45 60 75
Jung-hwan 0 0 30 30 60
Dong-ryong 0 0 15 25 50

5
2nd Step
Column Reduction / Operation
Choose the lowest value and subtract it to all the
values in the column.
Employee A B C D E
Deok Sun 30 0 45 60 70
Taek 15 0 10 40 55
Sun-woo 30 0 45 60 75
Jung-hwan 0 0 30 30 60
Dong-ryong 0 0 15 25 50

6
2nd Step
Column Reduction / Operation
Choose the lowest value and subtract it to all the
values in the column.
Employee A B C D E
Deok Sun 30 0 35 35 20
Taek 15 0 0 15 5
Sun-woo 30 0 35 35 25
Jung-hwan 0 0 20 5 10
Dong-ryong 0 0 5 0 0

7
3rd Step
Striking of Zeroes
Strike all the zeroes using the least lines possible.

Employee A B C D E
Deok Sun 30 0 35 35 20
Taek 15 0 0 15 5
Sun-woo 30 0 35 35 25
Jung-hwan 0 0 20 5 10
Dong-ryong 0 0 5 0 0

8
How to Strike Zeroes?
1. After the column reduction, try to assign jobs, first by row with single zero. If there are
multiple zeroes in the row, move to the next.
2. After assigning jobs in rows, do column assignment with single zero. If there are
multiple zeroes in the column, move to the next.
3. If there are employees with unassigned jobs, tick the row/s with unassigned jobs.
4. In the ticked rows, look for the zero, then tick the column where it also appears
• In that column look for an assigned zero and tick the row where the assigned zero appears
5. Repeat the process for other unassigned rows.
6. Draw vertical lines through the ticked columns and horizontal lines through unticked
rows

9
3rd Step
Striking of Zeroes
Strike all the zeroes with the least lines possible.

Employee A B C D E
Deok Sun 30 0 35 35 20
Taek 15 0 0 15 5
Sun-woo 30 0 35 35 25
Jung-hwan 0 0 20 5 10
Dong-ryong 0 0 5 0 0

10
3rd Step
Striking of Zeroes
Strike all the zeroes with the least lines possible.

Employee A B C D E
Deok Sun 30 0 35 35 20 *
Taek 15 0 0 15 5
Sun-woo 30 0 35 35 25 x
Jung-hwan 0 0 20 5 10 x
Dong-ryong 0 0 5 0 0
x x

11
3rd Step
Improvement (if lines are not optimal)
Find the lowest value amongst the unstruck values.
Deduct it with the unstruck values.
If the number is struck once, then the value remains the same
If the number is struck twice/crossing, then add the value.
Employee A B C D E
Deok Sun 30 0 35 35 20 *
Taek 15 0 0 15 5
Sun-woo 30 0 35 35 25 x
Jung-hwan 0 0 20 5 10 x
Dong-ryong 0 0 5 0 0
x x

12
3rd Step
Improvement (if lines are not optimal)
Find the lowest value amongst the unstruck values.
Deduct it with the unstruck values.
If the number is struck once, then the value remains the same
If the number is struck twice/crossing, then add the value.
Employee A B C D E
Deok Sun 30 0 30 30 15 *
Taek 20 5 0 15 5
Sun-woo 30 0 30 30 20 x
Jung-hwan 0 0 15 0 5 x
Dong-ryong 5 5 5 0 0
x x

13
3rd Step
Striking of Zeroes after Improvement (if lines are not optimal)
Strike all the zeroes with the least lines possible.

Employee A B C D E
Deok Sun 30 0 30 30 15
Taek 20 5 0 15 5
Sun-woo 30 0 30 30 20
Jung-hwan 0 0 15 0 5
Dong-ryong 5 5 5 0 0

14
3rd Step
Striking of Zeroes after Improvement (if lines are not optimal)
Strike all the zeroes with the least lines possible.

Employee A B C D E
Deok Sun 30 0 30 30 15 *
Taek 20 5 0 15 5
Sun-woo 30 0 30 30 20 x
Jung-hwan 0 0 15 0 5
Dong-ryong 5 5 5 0 0
x

15
3rd Step
Repeat improvement if number of strikes is not optimal
Improvement

Employee A B C D E
Deok Sun 30 0 30 30 15 *
Taek 20 5 0 15 5
Sun-woo 30 0 30 30 20 x
Jung-hwan 0 0 15 0 5
Dong-ryong 5 5 5 0 0
x

16
3rd Step
Repeat improvement if number of strikes is not optimal
Improvement

Employee A B C D E
Deok Sun 15 0 15 15 0 *
Taek 20 10 0 15 5
Sun-woo 15 0 15 15 5 x
Jung-hwan 0 5 15 0 5
Dong-ryong 5 10 5 0 0
x

17
3rd Step
Repeat improvement if number of strikes is not optimal
Striking of Zeroes

Employee A B C D E
Deok Sun 15 0 15 15 0
Taek 20 10 0 15 5
Sun-woo 15 0 15 15 5
Jung-hwan 0 5 15 0 5
Dong-ryong 5 10 5 0 0

18
3rd Step
Repeat improvement if number of strikes is not optimal
Striking of Zeroes

Employee A B C D E
Deok Sun 15 0 15 15 0 x
Taek 20 10 0 15 5
Sun-woo 15 0 15 15 5 *
Jung-hwan 0 5 15 0 5
Dong-ryong 5 10 5 0 0 x
x x x

19
4th Step
Assigning of Jobs
Assign single zero per row, then single zero per column
If there are still unassigned zero, go back to per row
assignment, then per column assignment

Employee A B C D E
Deok Sun 15 0 15 15 0
Taek 20 10 0 15 5
Sun-woo 15 0 15 15 5
Jung-hwan 0 5 15 0 5
Dong-ryong 5 10 5 0 0

20
4th Step
Assigning of Jobs
Assign single zero per row, then single zero per column
If there are still unassigned zero, go back to per row
assignment, then per column assignment

Employee A B C D E
Deok Sun 15 0 15 15 0
Taek 20 10 0 15 5
Sun-woo 15 0 15 15 5
Jung-hwan 0 5 15 0 5
Dong-ryong 5 10 5 0 0

21
 Step
5th
Computing Optimal Cost

Employee Task COST

Employee A B C D E
Deok Sun E Deok Sun 160 130 175 190 200
Taek C Taek 135 120 130 160 175
Sun-woo 140 110 155 170 185
Sun-woo B Jung-hwan 50 50 80 80 110
Jung-hwan A Dong-ryong 55 55 70 80 105
Dong-ryong D
TOTAL --

22
 Step
5th
Computing Optimal Cost

Employee Task COST

Employee A B C D E
Deok Sun E 200 Deok Sun 160 130 175 190 200
Taek C 130 Taek 135 120 130 160 175
Sun-woo 140 110 155 170 185
Sun-woo B 110 Jung-hwan 50 50 80 80 110
Jung-hwan A 50 Dong-ryong 55 55 70 80 105
Dong-ryong D 80
TOTAL -- 570

23
NEXT EXAMPLE
1st Step
Row Reduction / Operation
Choose the lowest value and subtract it to all the
values in the row.
A B C D E F G H
Miya 145 160 160 150 155 145 165 160
Layla 75 80 85 80 80 65 90 85
Franco 60 60 80 70 65 55 80 70
Rafaela 75 80 85 70 70 65 90 85
Roger 55 60 75 65 70 55 70 70
Chou 95 105 115 115 105 95 120 120
Odette 155 165 170 165 170 160 180 175
Lancelot 135 145 145 150 150 135 145 160

25
1st Step
Row Reduction / Operation
Choose the lowest value and subtract it to all the
values in the row.
A B C D E F G H
Miya 0 15 15 5 10 0 20 15
Layla 10 15 20 15 15 0 25 20
Franco 5 5 25 15 10 0 25 15
Rafaela 10 15 20 5 5 0 25 20
Roger 0 5 20 10 15 0 15 15
Chou 0 10 20 20 10 0 25 25
Odette 0 10 15 10 15 5 25 20
Lancelot 0 10 10 15 15 0 10 25

26
2nd Step
Column Reduction / Operation
Choose the lowest value and subtract it to all the
values in the column.
A B C D E F G H
Miya 0 15 15 5 10 0 20 15
Layla 10 15 20 15 15 0 25 20
Franco 5 5 25 15 10 0 25 15
Rafaela 10 15 20 5 5 0 25 20
Roger 0 5 20 10 15 0 15 15
Chou 0 10 20 20 10 0 25 25
Odette 0 10 15 10 15 5 25 20
Lancelot 0 10 10 15 15 0 10 25

27
2nd Step
Column Reduction / Operation
Choose the lowest value and subtract it to all the
values in the column.
A B C D E F G H
Miya 0 10 5 0 5 0 10 0
Layla 10 10 10 10 10 0 15 5
Franco 5 0 15 10 5 0 15 0
Rafaela 10 10 10 0 0 0 15 5
Roger 0 0 10 5 10 0 5 0
Chou 0 5 10 15 5 0 15 10
Odette 0 5 5 5 10 5 15 5
Lancelot 0 5 0 10 10 0 0 10

28
3rd Step
Striking of Zeroes
Strike all the zeroes with the least lines possible.
A B C D E F G H
Miya 0 10 5 0 5 0 10 0
Layla 10 10 10 10 10 0 15 5
Franco 5 0 15 10 5 0 15 0
Rafaela 10 10 10 0 0 0 15 5
Roger 0 0 10 5 10 0 5 0
Chou 0 5 10 15 5 0 15 10
Odette 0 5 5 5 10 5 15 5
Lancelot 0 5 0 10 10 0 0 10

29
3rd Step
Striking of Zeroes
Strike all the zeroes with the least lines possible.
A B C D E F G H
Miya 0 10 5 0 5 0 10 0 x
Layla 10 10 10 10 10 0 15 5 *
Franco 5 0 15 10 5 0 15 0 x
Rafaela 10 10 10 0 0 0 15 5
Roger 0 0 10 5 10 0 5 0 x
Chou 0 5 10 15 5 0 15 10 x
Odette 0 5 5 5 10 5 15 5 *
Lancelot 0 5 0 10 10 0 0 10
x x x x x

30
3rd Step
Improvement (if lines are not optimal)
Find the lowest value amongst the unstruck values.
Deduct it with the unstruck values.
If the number is struck once, then the value remains the same
If the number is struck twice/crossing, then add the value.
A B C D E F G H
Miya 0 10 5 0 5 0 10 0 x
Layla 10 10 10 10 10 0 15 5 *
Franco 5 0 15 10 5 0 15 0 x
Rafaela 10 10 10 0 0 0 15 5
Roger 0 0 10 5 10 0 5 0 x
Chou 0 5 10 15 5 0 15 10 x
Odette 0 5 5 5 10 5 15 5 *
Lancelot 0 5 0 10 10 0 0 10
x x x x x

31
3rd Step
Improvement (if lines are not optimal)
Find the lowest value amongst the unstruck values.
Deduct it with the unstruck values.
If the number is struck once, then the value remains the same
If the number is struck twice/crossing, then add the value.
A B C D E F G H
Miya 0 10 0 0 0 0 5 0 x
Layla 10 10 5 10 5 0 10 5 *
Franco 5 0 10 10 0 0 10 0 x
Rafaela 15 15 10 5 0 5 15 10
Roger 0 0 5 5 5 0 0 0 x
Chou 0 5 5 15 0 0 10 10 x
Odette 0 5 0 5 5 5 10 5 *
Lancelot 5 10 0 15 10 5 0 15
x x x x x

32
3rd Step
Striking of Zeroes after Improvement (if lines are not optimal)
Strike all the zeroes with the least lines possible.

A B C D E F G H
Miya 0 10 0 0 0 0 5 0
Layla 10 10 5 10 5 0 10 5
Franco 5 0 10 10 0 0 10 0
Rafaela 15 15 10 5 0 5 15 10
Roger 0 0 5 5 5 0 0 0
Chou 0 5 5 15 0 0 10 10
Odette 0 5 0 5 5 5 10 5
Lancelot 5 10 0 15 10 5 0 15

33
3rd Step
Striking of Zeroes after Improvement (if lines are not optimal)
Strike all the zeroes with the least lines possible.

A B C D E F G H
Miya 0 10 0 0 0 0 5 0
Layla 10 10 5 10 5 0 10 5 *
Franco 5 0 10 10 0 0 10 0 x
Rafaela 15 15 10 5 0 5 15 10
*
Roger 0 0 5 5 5 0 0 0 x
Chou 0 5 5 15 0 0 10 10 x
Odette 0 5 0 5 5 5 10 5 x
Lancelot 5 10 0 15 10 5 0 15 x
x x x x x x x

34
4th Step
Assigning of Jobs
Assign single zero per row, then single zero per column
If there are still unassigned zero, go back to per row
assignment, then per column assignment
A B C D E F G H
Miya 0 10 0 0 0 0 5 0
Layla 10 10 5 10 5 0 10 5
Franco 5 0 10 10 0 0 10 0
Rafaela 15 15 10 5 0 5 15 10
Roger 0 0 5 5 5 0 0 0
Chou 0 5 5 15 0 0 10 10
Odette 0 5 0 5 5 5 10 5
Lancelot 5 10 0 15 10 5 0 15

35
 4th Step
Assigning of Jobs
Assign single zero per row, then single zero per column
If there are still unassigned zero, go back to per row
assignment, then per column assignment
A B C D E F G H
Miya 0 10 0 0 0 0 5 0
Layla 10 10 5 10 5 0 10 5
Franco 5 0 10 10 0 0 10 0
Rafaela 15 15 10 5 0 5 15 10
Roger 0 0 5 5 5 0 0 0
Chou 0 5 5 15 0 0 10 10
Odette 0 5 0 5 5 5 10 5
Lancelot 5 10 0 15 10 5 0 15

Problem: Cannot assign job to Franco and Roger

36
 Step
5th
Computing Optimal Cost

Task Cost Task Cost Task Cost

Miya D Miya D Miya D
Layla F Layla F Layla F
Franco B/H Franco B Franco H
Rafaela E Rafaela E Rafaela E
Roger B/H Roger H Roger B
Chou A Chou A Chou A
Odette C Odette C Odette C
Lancelot G Lancelot G Lancelot G

37
 Step
5th
Computing Optimal Cost

Task Cost Task Cost

Miya D 150 Miya D 150 A B C D E F G H
Layla F 65 Layla F 65 Miya 145 160 160 150 155 145 165 160
Layla 75 80 85 80 80 65 90 85
Franco B 60 Franco H 70 Franco 60 60 80 70 65 55 80 70
Rafaela E 70 Rafaela E 70 Rafaela 75 80 85 70 70 65 90 85
Roger 55 60 75 65 70 55 70 70
Roger H 70 Roger B 60 Chou 95 105 115 115 105 95 120 120
Chou A 95 Chou A 95 Odette 155 165 170 165 170 160 180 175
Lancelot 135 145 145 150 150 135 145 160
Odette C 170 Odette C 170
Lancelot G 145 Lancelot G 145
TOTAL 825 TOTAL 825

38
 Step
5th
Computing Optimal Cost

Employee Task COST

Employee A B C D E
Deok Sun E 200 Deok Sun 160 130 175 190 200
Taek C 130 Taek 135 120 130 160 175
Sun-woo 140 110 155 170 185
Sun-woo B 110 Jung-hwan 50 50 80 80 110
Jung-hwan A 50 Dong-ryong 55 55 70 80 105
Dong-ryong D 80
TOTAL -- 570

39