Chapter 8, Problem 57E

Consider the project described by the project digraph shown in Fig. $8-42$.

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

b. Find the critical-time priority list.

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

d. Find an optimal schedule for $N=2$ processors.

e. Use the relative error formula $\epsilon =\text{Fin}-\text{OptOpt}$ to find the relative error of the schedule found in (c).

Figure $8-42$