Chapter 8, Problem 51E

Consider the project digraph shown in $Fig.8-40$.

a. Use the backflow algorithm to find the critical time for each vertex.

b. Find the critical path for the project.

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

d. Explain why the schedule obtained in (c) is optimal.

Figure 8-40