PRODUCTION ENGINEERING 2 (PENG 201)

TUTORIAL 8 - WORK CENTER SCHEDULING

1. The following table gives the operation times and due dates for five jobs which are
to be processed on a machine. Assign the jobs according to the shortest operation
time.
Job Processing Time (days) Due date (days hence)
101 6 5
102 7 3
103 4 4
104 9 7
105 5 2

Calculate the mean flow time. (Round your answer to 1 decimal place.)
Solution
By the SOT rule, the jobs would be assigned in the following order: 103, 105, 101, 102,
and 104.

Activity 103 105 101 102 104

Flow Time 4 5 6 7 9
Cumulative 4 9 15 22 31

The mean flow time is: (4+9+15+22+31)/5 = 81/5 = 16.2 days

2. The MediQuick lab has three lab technicians available to process blood samples
and three jobs that need to be assigned. Each technician can do only one job. The
table below represents the lab’s estimate (in dollars) of what it will cost for each job
to be completed. Assign the technicians to the jobs to minimize costs.

Job Tech A Tech B Tech C

J-432 11 14 6
J-487 8 10 11
J-492 9 12 7

Solution

Job Tech A Tech B Tech C

1
 J-432 11 14 6
J-487 8 10 11
J-492 9 12 7

Row reduction
Job Tech A Tech B Tech C
J-432 5 8 0
J-487 0 2 3
J-492 2 5 0

Column reduction
Job Tech A Tech B Tech C
J-432 5 6 0
J-487 0 0 3
J-492 2 3 0

Draw minimum number of vertical and horizontal lines to cover zeros

Job Tech A Tech B Tech C
J-432 5 6 0
J-487 0 0 3
J-492 2 3 0

Job Tech A Tech B Tech C

J-432 5 6 0
J-487 0 0 3
J-492 2 3 0

Because two lines instead of 3, cover all the zeros, the solution is not optimal. Subtract
the smallest uncovered number and add it to numbers at the intersection of the two
lines. Crossed out numbers not intersections remain unchanged.

Job Tech A Tech B Tech C

J-432 3 4 0
J-487 0 0 5
J-492 0 1 0

Cover the zeros with lines again.

Job Tech A Tech B Tech C

J-432 3 4 0
J-487 0 0 5
J-492 0 1 0

Because three lines are needed, an optimal assignment can be made.

Assign J-432 to C, J-487 to B and J-492 to A
Minimum cost is 6+10+9 = $25

2
3. Christine has three cars that must be overhauled by her mechanic, Megan. Given
the following data about the cars, use least slack per remaining operation to
determine Megan's scheduling priority for each car.

Customer Pick-Up Remaining

Car Time (Hours Overhaul Time Remaining Operation
Hence) (Hours)

A 10 4 Painting

Wheel Alignment,
B 17 5
Painting
Chrome plating,
C 15 1
Painting, Seat Repair

Solution

Remaining Number of Slack per

Customer
Car overhaul remaining Slack remaining
pick-up time
time operations operations
A 10 4 1 6 6.0
B 17 5 2 12 6.0
C 15 1 3 14 4.7
Select car C first, then A and B tie for second.

4. A manufacturing facility has five jobs to be scheduled into production. The

following table gives the processing times plus the necessary wait times and
other necessary delays for each of the jobs. Assume that today is April 3 and the
jobs are due on the dates shown:

Processing
Job Delay Time Total Time Due Date
Time
1 2 12 14 April 30
2 5 8 13 April 21
3 9 15 24 April 28
4 7 9 16 April 29
5 4 22 26 April 27

Determine two schedules, starting the order in which the jobs are to be done.
Use the critical ratio priority rule for one. You may use any other run for the
second schedule as long as you state what it is.

Solution

3
 Job Processing time Delay time Total time Due date CR
1 2 12 14 27 1.93
2 5 8 13 18 1.38
3 9 15 24 25 1.04
4 7 9 16 26 1.63
5 4 22 28 24 0.86

Time remaining until due date

CR=
Total processing time

Sequences:

Critical ratio would be 5, 3, 2, 4, 1

Earliest due date: 2, 5, 3, 4, 1

Shortest processing time: 2, 1, 4, 3, 5

5. The following table contains information regarding jobs that are to be scheduled
through one machine. Assume jobs are listed in order of arrival (i.e., A, then B,
then C, etc.).

Processing Due
Job
Time (Days) Date
A 4 20
B 12 30
C 2 15
D 11 16
E 10 18
F 3 5
G 6 9

a) What is the first-come, first-served (FCFS) schedule?

b) What is the shortest operating time (SOT) schedule?
c) What is the slack time remaining (STR) schedule?
d) What is the earliest due date (EDD) schedule?
e) What are the mean flow times for each of the schedules above? (Round your
answers to 1 decimal place.)

Solution

4
a. FCFS

Job Processing time Due date Flow time

A 4 20 4
B 12 30 16
C 2 15 18
D 11 16 29
E 10 18 39
F 3 5 42
G 6 9 48
Total flow time 196
Mean flow time 28
b. SOT

Job Processing time Due date Flow time

C 2 15 2
F 3 5 5
A 4 20 9
G 6 9 15
E 10 18 25
D 11 16 36
B 12 30 48
Total flow time 140
Mean flow time 20
c. STR

Processing Due Slack Time

Job remaining
Time (Days) Date
A 4 20 16
B 12 30 18
C 2 15 13
D 11 16 5
E 10 18 8
F 3 5 2
G 6 9 3

Job Processing time Due date Slack Flow time

F 3 5 2 3
G 6 9 3 9
D 11 16 5 20
E 10 18 8 30
C 2 15 13 32
A 4 20 16 36
B 12 30 18 48
Total flow time 178
Mean flow time 25.4
d. DD

5
 Job Processing time Due date Flow time
F 3 5 3
G 6 9 9
C 2 15 11
D 11 16 22
E 10 18 32
A 4 20 36
B 12 30 48
Total flow time 161
Mean flow time 23

e. Summary

Priority rule Mean flow time (days)

FCFS 28.0
SOT 20.0
STR 25.4
DD 23.0

6. Jobs A, B, C, D and E must go through Processes I and II in that sequence

(Process I first, then Process II). Use Johnson’s rule to determine the optimal
sequence in which to schedule the jobs to minimize the total required time.

Required Processing
Required Processing Time
Job Time on Process II (in
on Process I (in hours)
hours)

A 4 5
B 16 14
C 8 7
D 12 11
E 3 9

Solution
Job Process I Process II Order of Position in
Time Time Selection Sequence
A 4 5 2nd 2nd
B 16 14 5th 3rd
C 8 7 3rd 5th
D 12 11 4th 4th
E 3 9 1st 1st

6
 0 10 20 30 40 50 60

Process

Time

7. Schedule the following six jobs through two machines in sequence to minimize the
flow time using Johnson’s rule.

Job Machine 1 Machine 2

A 5 2
B 16 15
C 1 9
D 13 11
E 17 3
F 18 7
Solution

Operation Operation Order of Position in

Job time 1 time 2 Selection Sequence
A 5 2 2nd 6th
B 16 15 6th 2nd
C 1 9 1st 1st
D 13 11 5th 3rd
E 17 3 3rd 5th
F 18 7 4th 4th

Time
10 20 30 40 50 60 70 80
Process

1 C B D F E A

2 C B D F E A

8. The following matrix contains the costs (in dollars) associated with assigning Jobs A,
B, C, D, and E to Machines 1, 2, 3, 4, and 5.
7
 Machines
Jobs 1 2 3 4 5
A 6 11 12 3 10
B 5 12 10 7 9
C 7 14 13 8 12
D 4 15 16 7 9
E 5 13 17 11 12

Assign jobs to machines to minimize costs.

Solution

Machine

1 2 3 4 5

A 6 11 12 3 10

B 5 12 10 7 9
Job C 7 14 13 8 12

D 4 15 16 7 9

E 5 13 17 11 12
Row reduction

Machine

1 2 3 4 5

A 3 8 9 0 7

B 0 7 5 2 4
Job C 0 7 6 1 5

D 0 11 12 3 5

E 0 8 12 6 7

Column reduction

Machine

8
 1 2 3 4 5

A 3 1 4 0 3
0
B 0 0 2 0
Job C 0 0 1 1 1

D 0 4 7 3 1

E 0 1 7 6 3

Because 4 lines suffice, the solution is not optimal. Subtract the smallest uncovered
number 1 and add it to numbers at the intersection of the two lines. Crossed out
numbers not intersections remain unchanged.
Cover the zeros with lines again.

Optimal solution

Machine

1 2 3 4 5
0 2
A 3 1 3
0 3
B 1 1 0
Job 0 0
C 0 0 1
0
D 0 4 6 3

E 0 1 6 6 2

Optimal solution

Assign Cost
A 4 $ 3
B 3 10
C 2 14
D 5 9
E 1 5
Total $41