Applications of Graph Theory to PERT Critical Path Analysis.
Themis optimization research program,
TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Pagination or Media Count:
The first part of this report is concerned with the study of the detailed structure of networks sometimes referred to as directed acyclic networks. A number of new properties in theorems concerning such networks have been derived and although they do not necessarily assist in the generalization of the statistical PERT algorithms, they are useful in surveying the multiplicity of networks that might be encountered and in establishing convergence proofs and other properties of the algorithms that have been developed to date. Based upon the study of the properties of PERT networks an attempt is made to develop algorithms which at least provide approximate answers for both the statistical distribution of the project completion times as well as for their expectations. Modified author abstract
- Administration and Management