Computing Bounds on Project Duration Distributions for Stochastic PERT Networks

Naval Research Logistics

Volumn 47, Issue 7, 2000, Pages 559-580

  Iida, Tetsuo ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347069898     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/1520-6750(200010)47:7<559::AID-NAV2>3.0.CO;2-9     Document Type: Article

References (23)

1. R.E. Barlow and F. Proschan, Statistical theory of reliability and life testing, Holt, Rinehart and Winston, New York, 1975.
2. J.M. Burt, Jr., and M.B. Garman, Monte Carlo techniques for stochastic PERT network analysis, INFOR 9 (1971), 248-262.
3. J.M. Burt, Jr., and M.B. Garman, Conditional Monte Carlo: A simulation technique for stochastic network analysis, Manage Sci 18(1971), 207-217.
4. C.T. Clingen, A modification of Fulkerson's PERT algorithm, Oper Res 11 (1964), 629-632.
5. L. Devroye, Inequalities for the completion times of stochastic PERT networks, Math Oper Res 4 (1979), 441-447.
6. B.M. Dodin, Bounding the project completion time distribution in PERT networks, Oper Res 33 (1985), 862-881.
7. S.E. Elmaghraby, On the expected duration of PERT type networks, Manage Sci 13 (1967), 299-306.
8. S.E. Elmaghraby, Activity networks, Wiley, New York, 1977.
9. J.D. Esary, F. Proschan, and D.W. Walkup, Association of random variables, with applications, Ann Math Stat 38 (1967), 1466-1474.
10. D.R. Fulkerson, Expected critical path lengths in PERT networks, Oper Res 10 (1962), 808-817.
11. J.N. Hagstrom, Computational complexity of PERT problems, Networks 18 (1988), 139-147.
12. J.N. Hagstrom, Computing the probability distribution of project duration in a PERT network, Networks 20 (1990), 231-244.
13. H.O. Hartley and A.W. Wortham, A statistical theory for PERT critical path analysis, Manage Sci 12 (1966), B469-B481.
14. G.B. Kleindorfer, Bounding distributions for a stochastic acyclic networks, Oper Res 19 (1971), 1586-1601.
15. J.H. Lindsey, II, An estimate of expected critical-path length in PERT networks, Oper Res 20 (1972), 800-812.
16. K.R. MacCrimmon and C.A. Ryavec, An analytical study of the PERT assumptions, Oper Res 12 (1964), 16-37.
17. J.J. Martin, Distribution of the time through a directed, acyclic network, Oper Res 13 (1965), 46-66.
18. L.J. Ringer, Numerical operators for statistical PERT critical path analysis, Manage Sci 16 (1969), B136-B143.
19. L.J. Ringer, A statistical theory for PERT in which completion times of activities are inter-dependent, Manage Sci 17 (1971), 717-723.
20. P. Robillard and M. Trahan, Expected completion time in PERT networks, Oper Res 24 (1976), 177-182.
21. P. Robillard and M. Trahan, The completion time of PERT networks, Oper Res 25 (1977), 15-29.
22. A.W. Shogan, Bounding distributions for a stochastic PERT network. Networks 7 (1977), 359-381.
23. R.M. Van Slyke, Monte Carlo methods and the PERT problem, Oper Res 11 (1963), 839-860.