Unformatted text preview: sponds to showering, finishing math assignment, eating breakfast and dressing. Note that there were choices available in the labeling of vertices Y and Z. Since Y is the only one of these on the critical path, we conclude that the only other critical path is MSBD. St St(,O) w v Solutions to Exercises v Y Y(W,39) 9 P 'ls.=:::. .e++~T R P(W,36) T T(X,48) or (Y,48) 0<:::::'1. ....=o_$) )",. ....:=+ert~__f) T(R,45) V(St,18) R(Y,36) 16. This is a type I scheduling problem. We draw a digraph whose vertices represent stages in the process...
View
Full Document
 Summer '10
 any
 Computer Science, Graph Theory, Shortest path problem, Critical path method

Click to edit the document details