Activity Networks: Project Planning and Control by Network Models |
From inside the book
Results 1-3 of 54
Page 241
... evaluated , and then the average evaluated . This turned out to be e , PERT estimate proceeds as follows : 1,2 = 8 / 3 ... evaluate the functions ( f ) . ƒ1 = 0 = 12-31.2-33 = 8 √3 = 21 ( 523232 + 7232 + 2 × 8 ) = 22 2x 3 J. = 12/17 ( 2 ...
... evaluated , and then the average evaluated . This turned out to be e , PERT estimate proceeds as follows : 1,2 = 8 / 3 ... evaluate the functions ( f ) . ƒ1 = 0 = 12-31.2-33 = 8 √3 = 21 ( 523232 + 7232 + 2 × 8 ) = 22 2x 3 J. = 12/17 ( 2 ...
Page 245
... evaluate the various func- tions in the order of things " as given , " from node I to node n . On the other hand , backward movement from node i means that the arrows of the subnetwork , have been reversed and that we are evaluating ...
... evaluate the various func- tions in the order of things " as given , " from node I to node n . On the other hand , backward movement from node i means that the arrows of the subnetwork , have been reversed and that we are evaluating ...
Page 249
... evaluate w , we need u§ ) , u ( 2 ) , v ) , and v2 ) , which are given by : u ( 2 ) = = 558 54 ' 769 54 each with probability 6863 v ( 2 ) = 9096 = 648 648 ' each with probability Since ( 1/2 ) ( 6863 / 648 + 9096 / 648 ) > ( 1/2 ) ...
... evaluate w , we need u§ ) , u ( 2 ) , v ) , and v2 ) , which are given by : u ( 2 ) = = 558 54 ' 769 54 each with probability 6863 v ( 2 ) = 9096 = 648 648 ' each with probability Since ( 1/2 ) ( 6863 / 648 + 9096 / 648 ) > ( 1/2 ) ...
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