A contractor has six jobs awaiting processing at a workstation that is also a bottleneck and therefore

is only capable of processing one job at a time. The day the job was received, its processing time

and due date are given in the following table. It is now day 7.

Day Job Job Processing Job Due

Job was Received Time (days) Day

A 1 6 29

B 2 8 15

C 3 5 37

D 4 2 25

E 5 9 32

F 6 4 43

Calculate the average throughput time and, for each job, the number of days overdue using the

following priority sequencing rules:

i. First-come-first-serve

ii. Earliest due date

iii. Shortest processing time

Which rule should be used, in your opinion? Why?

Problem #2 A contractor has six jobs awaiting processing at a workstation that is also a bottleneck and therefore is only capable of processing one job at a time. The day the job was received, its processing time and due date are given in the following table. It is now day 7. Day Job Job Processing Job Due Job was Received Time (days) Day 6 29 B 2 8 15 3 5 37 D 4 2 25 E 5 9 32 F 4 43 Calculate the average throughput time and, for each job, the number of days overdue using the following priority sequencing rules: i. First-come-first-serve iii. Shortest processing time ii. Earliest due date Which rule should be used, in your opinion? Why