Chapter 8, Problem 56E

Schedule the project given in $\text{Exercise 26}$ ( $\text{Table 8-5}$) (setting up a ballroom for a wedding) with $\text{N}=3$ processors using the critical-path algorithm. Show the timeline, and give the project finishing time. (Note that the project digraph was done in $\text{Exercise 26}$.)

Table 8-5

Tasks	Label (P-time)	Precedent tasks
Set up tables and chairs	TC(1.5)
Set tablecloths and napkins	TN(0.5)	TC
Make flower arrangements	FA(2.2)
Unpack crystal, china, and flatware	CF(1.2)
Put place settings on table	PT(1.8)	TN, CF
Arrange table decorations	TD(0.7)	FA, TP
Set up the sound system	SS(1.4)
Set up the bar	SB(0.8)	TC