Sarah is a graduate student who must make 4 large experimental runs on her personal computer as part of her thesis research. The jobs require virtually all the computer’s resources, so only one can be processed at a time and none can be interrupted once it has begun. The following table shows the number of days of computing each job will require, the earliest that all data will be available, and the day Sarah has promised the result to her thesis advisor.

1 2 3 4 Time 15 8 20 6 Earliest 0 0 10 10 Promise 20 20 30 20 Before beginning any work, Sarah wants to compute an optimal schedule. Assume promised times are only targets.

Do

(a) through (h) as in Exercise 11-34, evaluating the schedule with start times 8, 0, 23, and 43, respectively.