## Activity Networks: Project Planning and Control by Network Models |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Structure and Terminology 1 | 18 |

3 COST CONSIDERATIONS | 31 |

DIGRAPHS AND LINE DIGRAPHS | 39 |

Copyright | |

6 other sections not shown

### 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 distribution dual equal equations evaluate example exclusive-or expected duration expected value feasible Figure flow GERT given hence heuristic labeled Laplace transform line digraph linear lower bound Mason's rule minimize modified Monte Carlo N/A N/A network of Fig Normally distributed obtained optimal optimum parameters PERT estimate PERT model possible precedence primal probability problem procedure project duration project network random random variables reader realization of node 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 transmittance variables variance vector yields z-transform