A small printing shop has 10 jobs it must schedule. The processing times and due dates for each job are summarized in the following table.

a. Suppose the jobs are scheduled in ascending order by processing time. How many jobs will be late? By how many totals days will the jobs be late? What is the maximum amount by which any job is late?
b. Suppose the jobs are scheduled in ascending order by due date. How many jobs will be late? By how many totals days will the jobs be late? What is the maximum amount by which any job is late?
c. Use Solver’s Evolutionary algorithm to determine the schedule that minimizes the number of jobs that are late. What is the solution? (Note that you may want to run Solver several times.)
d. Use Solver’s Evolutionary algorithm to determine the schedule that minimizes the total number of days by which the jobs are late. What is the solution?
e. Use Solver’s Evolutionary algorithm to determine the schedule that minimizes the maximum number of days by which any job is late. What is the solution?