This preview shows page 1. Sign up to view the full content.
Unformatted text preview: D is 2, the same as E. 21. (a) Since the time for a given task is independent on which other tasks have already been completed, and since some tasks may occur simultaneously, this is a type II scheduling problem. (b) S(-,O) 10 B (S,1O) W(B,18) CVS(B,12) 1 o The shortest time is the length of the longest path from S to T. This is 23 units of time. (SF, 23) T(A,23) S(CVS,14) (c) The critical path is B, R, DR, SF, A. The slack in cooking the wings is 4. The slack in chopping the vegetables for the salad and making the salad is 8 in each case. The slack in chopping the vegetables for the stirfry is 3....
View Full Document
- Summer '10
- Graph Theory