What people are saying - Write a review
We haven't found any reviews in the usual places.
2 TEMPORAL CONSIDERATIONS
3 COST CONSIDERATIONS
Structure and Terminology 1
8 other sections not shown
Other editions - View all
activity durations activity network adjacency matrix algorithm analysis analytical applied approach approximation arc durations assume assumption Beta beta distribution Chapter completion computing condition Consider constraints construction cost function critical defined denote determine discussion distribution dual equal equations equivalent evaluate event example exclusive-or expected duration expected value feasible Figure flow flow network Furthermore GERT given Hence heuristic labeled Laplace transform line digraph linear lower bound Mason's rule minimize modified network of Fig Normally distributed obtained optimal optimum parameters path PERT estimate PERT model possible precedence primal probability problem procedure project duration random variables reader realization of node reduce representation represents result sample schedule Section Semi-Markov Processes SF lag shown in Fig slack solution specified step subnetwork subroutine subset Suppose Table tasks terminal node Theorem tion transmittance variance vector wheatstone bridge yields z-transform zero