Chapter 8, Problem 58E

Consider the project digraph shown in $\text{Fig}\text{. 8-43}$, with the processing time given in hours.

a. Find the critical path and critical time for the project.

b. Find the critical-time priority list.

c. Schedule the project with $\text{N}=2$ processors using the critical-path algorithm. Show the timeline and the project finishing time.

d. Explain why any schedule for $\text{N}=2$ processors with finishing time $\text{Fin}=22$ must be an optimal schedule.

e. Schedule the project with $\text{N}=3$ processors using the critical-path algorithm. Show the timeline and the project finishing time.

f. Explain why the schedule found in (e) is an optimal schedule for three processors.

Figure 8-43