Activity Networks: Project Planning and Control by Network Models |
From inside the book
Results 1-3 of 57
Page 70
... reduce T ; conse- quently , go to the labeling for minimum - cost activities subroutine below . In the second eventuality , it is not possible to reduce T , and so terminate the analysis . = The reason for this latter conclusion is the ...
... reduce T ; conse- quently , go to the labeling for minimum - cost activities subroutine below . In the second eventuality , it is not possible to reduce T , and so terminate the analysis . = The reason for this latter conclusion is the ...
Page 74
... reduced , and the cost of such reduction is guaranteed to be minimal . When a nonbreakthrough condition is obtained it must be that the CPs have been exhausted . The node time - change subroutine then proceeds to reduce the length of ...
... reduced , and the cost of such reduction is guaranteed to be minimal . When a nonbreakthrough condition is obtained it must be that the CPs have been exhausted . The node time - change subroutine then proceeds to reduce the length of ...
Page 302
... reduced network : Sample Z3 : Z2 = max ( y12 + Y25 ; 21+ Y35 ) , F ( 22 ) = F25 ( 22 - Y12 ) F35 ( 22−21 ) ; Z3 ... reduce the given network by at least one activity , a trivial network must eventually be reached . Z2 23 + Y45 5 Y56 ...
... reduced network : Sample Z3 : Z2 = max ( y12 + Y25 ; 21+ Y35 ) , F ( 22 ) = F25 ( 22 - Y12 ) F35 ( 22−21 ) ; Z3 ... reduce the given network by at least one activity , a trivial network must eventually be reached . Z2 23 + Y45 5 Y56 ...
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