Ten jobs with the processing times and due dates listed in the table below are to be processed on a single machine. Job Processing Time Due Date 1 48 2 75 3 4 5 6 7 8 5 170 215 205 240 85 67 9 100 10 18 95 a) Find the schedule that minimizes the mean flowtime and report the minimum mean flowtime. b) Find the schedule that minimizes the maximum lateness and report the minimum maximum lateness value. c) Find the schedule that minimizes the number of tardy jobs. Report the number of tardy jobs in this schedule. d) Use the critical ratio rule to minimize the total tardiness. Report the resulting schedule and the corresponding total tardiness value. e) Suppose now that these ten jobs are to be processed on two identical machines running in parallel. Find the schedule on each one of the machines to minimize the mean flowtime. Report the corresponding mean flowtime value.