Unformatted text preview: and since some tasks may occur simultaneously, this is a type II scheduling problem. (b) U(P1,28) Q(8,10) 25 (c) The critical path is Q, B. There is no slack in any task on the critical path. The table shows the slack in the other activities. B(Q,35) Task PI P2 U The shortest time is the length of the longest path from S to T. This is 35 units of time. Slack 7 10 7 Task Tp C P Slack 16 15 10...
View Full Document
- Summer '10
- Graph Theory, Shortest path problem, shortest path, shortest path costs