Activity Networks: Project Planning and Control by Network Models |
Contents
DIGRAPHS AND LINE DIGRAPHS | 39 |
REFERENCES | 55 |
Models of TimeCost TradeOffs in Deterministic | 57 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
activity durations activity networks adjacency matrix algorithm analysis analytical approach approximation arc durations assume assumption Beta beta distribution Chapter completion computing Consider constraints construction cost function defined denote determine discussion distributed dual equal equations equivalent evaluate event example exclusive-or expected duration expected value feasible Figure flow GERT given Hence heuristic k₁ k₂ labeled Laplace transform line digraph linear lower bound Mason's rule minimize modified network of Fig Normally distributed obtained optimal parameters PERT estimate PERT model possible precedence primal probabilistic probability problem procedure project duration random random variables reader realization of node reduce representation result sample schedule Section Semi-Markov Processes shown in Fig slack solution specified SS lag subnetwork subroutine subset Table tasks terminal node Theorem tion transmittance variables variance vector wheatstone bridge Y₁ yields z-transform