Scheduling: Hungarian

Method & Johnson Rule

Job and Staff Scheduling

Chapter 16 of textbook: “Operations Management”, Stevenson, Hojati, and Cao

Scheduling: Assignment Problem
In Scheduling resources, we might be
interested in

Assigning job to machines or workers’

Assigning territories to salespeople.

Assigning repairs to repair crew.

 Scheduling: Assignment Problem
Worker Assignment Problem: A set of
It cost A B C D Jobs that need to be assigned
$8 for
worker 1 8 6 2 4 to a number of employees.
A to J 2 6 7 11 10
do job o
1 B 3 3 5 7 6
LP model using Excel Solver (X : i: job, j: worker)
4 5 10 12 9 ij

Cost associated with each job-

worker combination
Scheduling: Assignment Problem

Assignment model is used in assigning tasks/jobs

to resources.

Hungarian method is a method of assigning jobs

by a one-for-one matching to identify the lowest
cost solution
 Hungarian Method
1. Row reduction: subtract smallest # in each row
from every # in the row
Enter the result in a new table

2. Column reduction: subtract smallest # in each column

from every # in the column
Enter the result in a new table

3. Test whether an optimum assignment can be made

If number of lines equals

Determine minimum number
number of rows, an optimum
of lines needed to cross out all Else, go to step 4
assignment is possible. Go to
zeros
step 6
 Hungarian Method (Cont’d)
4. If number of lines < number of rows, modify
Add smallest uncovered # to
table:
#s crossed out but not at
Subtract smallest # from every
#s at intersections intersections of cross-out lines
uncovered # in table
of cross-out lines carry over to next table

5. Repeat steps 3 and 4 until optimal table is obtained

6. Make the assignments

Match items that have zeros,
Begin with rows or columns Eliminate both the row and
using only one match for each
with only one zero the column after the match
row and each column
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:
Row
Worker minimum
A B C D 1. Subtract the smallest
1 8 6 2 4 2 number in each row from
2 6 7 11 10 6 every number in the row
Job
3 3 5 7 6 3
4 5 10 12 9 5 Worker
A B C D
1 6 4 0 2
2 0 1 5 4
Job
3 0 2 4 3
4 0 5 7 4
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:
Worker
A B C D 2. Subtract the smallest
1 6 4 0 2 number in each column
2 0 1 5 4 from every number in the
Job
3 0 2 4 3
column
4 0 5 7 4

Column min. 0 1 02 Worker

A B C D
1 6 3 0 0
2 0 0 5 2
Job
3 0 1 4 1
4 0 4 7 2
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:

Worker
A B C D
3. Determine minimum
1 6 3 0 0 number of lines needed to
2 0 0 5 2 cross out all zeros
Job
3 0 1 4 1 Note: The smallest
Try to cross as many
4 0 4 7 2 uncovered value is 1 zeros as possible when
drawing lines

3. Since only three lines are No. of Lines ≠ No of rows

needed to cross out all zeros
and the table has four rows, Not Optimal
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:
Worker
A B C D 4. Subtract the smallest uncovered value
from every uncovered number,.
1 6 3 0 0
2 0 0 5 2
Job 4. And add smallest uncovered value to the
3 0 1 4 1
values at the intersection of covering lines.
4 0 4 7 2
Worker
A B C D
1 7 3 0 0
2 1 0 5 2
Job
3 0 0 3 0
4 0 3 6 1
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:

Worker Optimality Check: Determine the

A B C D minimum number of lines needed
1 7 3 0 0 to cross out all zeros. (Try to cross
2 1 0 5 2 out as many zeros as possible when
Job
3 0 0 3 0 drawing lines)
4 0 3 6 1

Since four lines are needed to No. of Lines = No. of rows

cross out all zeros
Optimality reached. Stop.
 Hungarian Method: Example 1
Determine the optimum assignment of jobs to workers for the following data:
Worker Make assignments: Start with rows
A B C D and columns with only one zero and
1 7 3 0 0 reference it to the original table
2 1 0 5 2 Jobs 1,2, and 4 are all taken (single 0 row or column),
Job
3 0 0 3 0 what remains is job 3, assign to the only
4 0 3 6 1 worker left D
Assignment Cost
Original
table Worker 2-B $7
A B C D 4-A $5
Match jobs with
1 8 6 2 4 1-C $2
J
workers that have a
2 6 7 11 10 3-D $6
o zero
B 3 3 5 7 6 Total $20
4 5 10 12 9
 Sequencing
Sequencing determines the order in which jobs will
be processed at a work centre or machine
Johnson’s Rule: technique for minimizing make-
span for a group of jobs to be processed on two
successive work centres/machines.

Minimizes total idle time

Several condition must be satisfied

Sequencing: Johnson’s Rule Conditions
Job time must be known and constant

Job times must be independent of sequence

Jobs must follow same two-step sequence

All units must be completed at the first work

centre before moving to second

There is enough space for WIP

Johnson’s Rule Optimum Sequence
2. Select the job with the
1. List the jobs and shortest time
their times at each
• If at 1st centre, schedule it first
work center • If at 2nd work centre, schedule it last

Repeat steps 2 & 3

until all jobs 3.Eliminate the job
have been from further
scheduled consideration
 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.

Job Work Centre 1 Work Centre 2

A 7 4
A B 5 8
C 10 6
D 12 9
E 9 14

Select Job with the shortest time.

It’s at the 2nd work centre, so schedule last.

 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.

Job Work Centre 1 Work Centre 2

A 7 4
B A B 5 8
C 10 6
D 12 9
E 9 14

Select Job with the shortest time.

It’s at the 1st work centre, so schedule first.

 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.

Job Work Centre 1 Work Centre 2

A 7 4
B C A
B 5 8
C 10 6
D 12 9
E 9 14

Select Job with the shortest time.

It’s at the 2nd work centre, so schedule in last available spot.

 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.

Job Work Centre 1 Work Centre 2

A 7 4
B E C A
B 5 8
C 10 6
D 12 9
E 9 14

Select Job with the shortest time. If there is a tie, then choose either.

It’s at the 1st work centre, so schedule in first available spot.

 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.

Job Work Centre 1 Work Centre 2

A 7 4
B E D C A B 5 8
C 10 6
D 12 9
E 9 14

Only D is left
 Johnson’s Rule: Example 2
Determine the job sequence for these 5 jobs, using Johnson’s rule.
B E D C A Job Work Centre 1 Work Centre 2
A 7 4
Let’s draw the sequence,
B 5 8
and find out how long the
Make-span is C 10 6
D 12 9
E 9 14

Make-
Span is 47
More Exercises
 Example A
Assign the following 5 trucks to 5 delivery locations. Do in a manner to minimize total
costs, given the data below. What’s the minimum cost?

Step 2:
Subtract column min
from each column
 Next slide
 Example A

Optimality Check.

Intersection
Example A
Example A

Single 0 rows.
Truck 1 to A
Truck 4 to B

Single 0 columns
Truck 5 to C

Truck 2 to D
Truck 3 to E
Alt solution
when same cost
 Example B
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 2-D is undesirable High value in the table

1. Row Reduction: Subtract the smallest number

in each row from every number in the row

We need to assign a relatively high cost to this

combination (2-D) to avoid it. (3 times equal the
highest value in the table,)
 Example B
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 2-D is undesirable

2. Column Reduction: Subtract the smallest

number in each column from every number
in the column
 Example B
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 2-D is undesirable;

3. Optimality Check: Is # of lines equal to #

of rows
 Example B
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: combination 2-D is undesirable

Make Assignments

Note 2 hasn’t been

assigned to D because
we gave such a high
value
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable
1. Row Reduction: Subtract the smallest number in
each row from every number in the row

We need to assign a relatively high cost to this

combinations (2-D) and (1-A) to avoid it (3 times equal
the highest value in the table)
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable

2. Column Reduction: Subtract the smallest

number in each column from every number
in the column
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable

3. Optimality Check: Is # of lines equal to #

of rows
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable
4. a. Subtract the smallest uncovered number from every uncovered
number in the table.
b. Add the smallest uncovered number (1) to the numbers at
intersections of cross-out lines.
c. Carry over numbers crossed out but not at intersections to the next
table.
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable

Optimality Check: Is # of lines equal to # of

rows

# of lines = # of rows
 Example C
Using the Hungarian method on the job assignment below, find the minimum cost under
theses condition: Combination 1-A and 2-D are undesirable

Make Assignments
 Example D
The five jobs below need to be sequenced between two cutting machines (Machin A and
B). What’s the minimum time span for all the jobs on both machines. What’s the idle time
if any?

Order of assignment is given by circles.

 Example D
The five jobs below need to be sequenced between two cutting machines (Machin A and
B). What’s the minimum time span for all the jobs on both machines. What’s the idle time
if any?

Time Span is 33; idle time is 3 hours for machine B; Machine A idle time will
depend if it’s doing other jobs or it has to wait for machine B to finish jobs, or it
can start jobs right away
 Example E
Find the best sequence (minimize time span) for the following jobs assigned to two
consecutive work centers. What’s the idle time for the 2nd work center?
 Example G
The following are profits accumulated for machine-job sequence. Use the matrix below
to maximize profits.

Convert Maximization into minimization

problem by subtracting all the element values
from the highest element value. (highest
element = 14)
 Example G
The following are profits accumulated for machine-job sequence. Use the matrix below
to maximize profits.

Determine minimum
number of lines needed to 3 ≠ 5;
cross out all zeros No. of Lines ≠ No of rows
 Example G
The following are profits accumulated for machine-job sequence. Use the matrix below
to maximize profits.

Smallest uncover is 1;
subtract from all
uncovered and add to
intersection.

Not optimal: 4 ≠ 5
No. of Lines ≠ No of rows
 Example G
The following are profits accumulated for machine-job sequence. Use the matrix below to
maximize profits.
Smallest uncover is 1;
subtract from all
uncovered and add to
intersection.

Optimal: 5 = 5
No. of Lines = No of rows
 Example G
The following are profits accumulated for machine-job sequence. Use the matrix below to
maximize profits.

Optimal Assignment = 1-C, 2-F, 3-D, 4-B, 5-A;

Max Profit = 10 + 5 + 14 + 14 + 7 = 50
 Example H
Find the best sequence (minimize time span) for the following jobs two step operations.
Determine the job sequence that will minimize the total time required to fill the orders
(i.e., the make-span) and determine the make-span?
Order Step 1 Step 2
A 1.20 3 1.40
B 0.90 2 1.30 B A G E F D C
C 2.00 0.80 1
D 1.70 1.50 5
E 1.60 6 1.80
F 2.20 1.75 7
G 1.30 4 1.40