A Statistical Theory for Pert in Which Completion Times of Activities are Inter-Dependent

This paper presents a method for taking into account dependency among certain activities in PERT networks. The method presented can be used with the reduction algorithm presented by Hartley and Wortham [Hartley, H. O., Wortham, A. W., A statistical theory for PERT critical path analysis. Management Science, Vol. 12 No. 10 (June 1966), pp. B-469–B-481.]. The addition of dependency among the completion times for certain types of activities should be a valuable aid in sensitivity analyses of PERT networks.

• 저널Management Science · 17(11) · 717–723
• 토픽Complex Systems and Decision Making · Management Science and Operations Research
• DOI10.1287/mnsc.17.11.717
• 저자Larry J. Ringer