A company has five jobs awaiting processing at a bottleneck work- station in a production facility. The day the job was received, its processing time and due date are given in the following table. It is now the beginning of day 13. Day Job Job was Received Time (days) Job Processing Job Due Day A 45 B 6 8 28 C 7 23 D 10 9. 35 E 12 21 Calculate the average throughput time and, for each job, the number of days overdue using the following priority sequencing rules: (a) First-come-first-serve (b) Earliest due date (c) Shortest processing time (d) Which rule should be used, in your opinion? Why? (e) The head mechanic at the production facility wants to perform mainte- nance on the bottleneck workstation used to process the jobs above. The mechanic insists the maintenance needs to be performed before day 45, and has indicated that the maintenance will take 3 days to complete and will take the workstation offline. Considering it is still day 13, when is the best time to perform the maintenance? (Hint: Treat the maintenance as though it is a new job.) FCFS sequence Job Pocessing time Due date Fiow tinme tadineis 32 15 14 26 22 25 26 18 Mean flow time = 17.4 Mean days past due date 5.4 Number of jibs in system = flow time /task time = 87/26 = 3.3461 2. SPT sequence Job Processing time Due date Flow tinme Tardiness A 32 17 22 26 Mean flow time =11.2 Mean days past due date =1.2 Number of jibs in system = 56/26=2.1538 3. EDD sequence Job Processing time Due date Flow te Tardiness 10 11 22 20 A. 32 24 Mean flow time =12.2 Mean days past due date =0 Number of jibs in system = 61/26=2.3461 Least flow time, and number of jobs in the system is achieved with SPT sequence, while least days past due date is obtained with EDD sequence