Activity Networks: Project Planning and Control by Network Models |
Contents
2 TEMPORAL CONSIDERATIONS | 18 |
3 COST CONSIDERATIONS | 31 |
DIGRAPHS AND LINE DIGRAPHS 39 | 39 |
Copyright | |
7 other sections not shown
Other editions - View all
Common terms and phrases
activity durations activity networks adjacency matrix algorithm allocation analysis analytical application approach approximation arc durations assume assumption Beta beta distribution Chapter completion computing Consider constraints construction cost function critical path critical path method defined denote determine discussion distributed dual equal equations equivalent evaluation example exclusive-or expected duration expected value feasible Figure flow GERT given Hence heuristic k₁ k₂ labeled Laplace transform line digraph linear lower bound Management Sci Mason's rule minimize Monte Carlo network of Fig Normally distributed obtained Oper optimal optimum parameters PERT estimate PERT model possible precedence primal probability problem procedure project duration random random variables reader reduce representation result sample schedule Section Semi-Markov Processes SF lag shown in Fig slack solution specified subnetwork subset Table tasks terminal node Theorem tion variables variance vector Y₁ yields z-transform