October’s work for Joe consists of five jobs, A, B, C, D, and E. Job A takes five days to complete and is due on day 10, job B takes ten days to complete and is due on day 15, job C takes two days to process and is due on day 5, job D takes eight days to process and is due on day 12, and job E, which takes six days to process, is due on day 8. There are 120 possible sequences for the five jobs. Clearly, enumeration is impossible. Let’s try some simple sequencing rules. Sequence the jobs by (a) first-come, first-served (FCFS), (b) earliest due date (DDATE), (c) minimum slack (SLACK), and (d) shortest processing time (SPT). Determine the completion time and tardiness of each job under each sequencing rule. Should Joe process his work as is—first-come, first-served? If not, what sequencing rule would you recommend to Joe? Job Processing Time Due Date A 5 10 B 10 15 C 2 5 D 8 12 E 6 8