This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4. The critical path is SABEGT: Pour the mold, calibrate, have a coffee break, polish and inspect. The shortest time is 23 units. 5. [BB] The new digraph is shown. The project now requires 18 units of time. The critical path is SF EW PaDV CT. The slack in Pl is now 1; the slack in the installation of kitchen cabinets is 3. All other tasks have slack 0 since they lie on the critical path. E(F,9) 1 V(D,16) 2 C(V,18) 6. (a) Since the time for each task depends on the tasks which have already been completed, this is a type I scheduling problem....
View
Full
Document
This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.
 Summer '10
 any
 Graph Theory

Click to edit the document details