A small printing shop has ten jobs that it must schedule. The processing times and

due dates for each job are summarized in the following table.

Job Processing Time (Days) Due Date

1 10 12

2 11 35

3 7 20

4 5 27

5 3 23

6 7 36

7 5 40

8 5 40

9 12 55

10 11 47

a. Suppose the jobs are scheduled in ascending order by processing time. How

many jobs will be late? By how many total 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 total 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?