Chapter 8, Problem 29E

Exercises 29 through 32 refer to a project consisting of 11 tasks (A through K) with the following processing times (in hours): $A\left(10\right),B\left(7\right),C\left(11\right),D\left(8\right),E\left(9\right),F\left(5\right),G\left(3\right),H\left(6\right),I\left(4\right),J\left(7\right),K\left(5\right).$

a. A schedule with $\text{N}=3$ processors produces finishing time $\text{Fin}=31$ hours. What is the total idle time for all the processors?

b. Explain why a schedule with $\text{N}=3$ processors must have finishing time $\text{Fin}\ge 25$ hours.