A new approximation algorithm for obtaining the probability distribution function for project completion time

Computers and Mathematics with Applications

Volumn 54, Issue 2, 2007, Pages 282-295

  Yao, Ming Jong ^a   Chu, Weng Ming ^a  

^a TUNGHAI UNIVERSITY   (Taiwan)

Author keywords

Approximation; Completion time; Discretization; Probability distribution function; Stochastic activity networks

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; FUNCTION EVALUATION; PROBABILITY DISTRIBUTIONS;

DISCRETIZATION; STOCHASTIC ACTIVITY NETWORKS;

ALGORITHMS;

EID: 34249865056     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2007.01.036     Document Type: Article

References (30)

1. Dodin B.M. Approximating the distribution function in stochastic networks. Comput. Oper. Res. 12 3 (1985) 251-264
2. Coppendale J. Manage risk in product and process development and avoid unpleasant surprises. Eng. Manage. J. 5 1 (1995) 35-38
3. Chatzoglou P., and Macaulay L. A review of existing models for project planning and estimation and the need for a new approach. Int. J. Proj. Manage. 14 (1996) 173-183
4. Elmaghraby S.E. Activity Networks: Project Planning and Control by Network Models (1977), Wiley, New York
5. Hagstorm J.N. Computational complexity of PERT problems. Networks 18 (1988) 139-147
6. Adlakha V.G. A classified bibliography of research on stochastic PERT networks: 1966-1987. INFOR 27 3 (1989) 272-296
7. Elmaghraby S.E. The estimation of some network parameters in the PERT model of activity networks: Review and critique. In: Slowinski R., and Weglarz J. (Eds). Advances in Project Scheduling (1989), Elsevier, Amsterdam 371-432
8. Martin J.J. Distribution of the time through a directed acyclic networks. Oper. Res. 13 1 (1965) 46-66
9. Fisher D.L., Saisi D., and Goldstein W.M. Stochastic PERT networks: OP diagrams critical paths and the project completion time. Comput. Oper. Res. 12 5 (1985) 471-482
10. Kulkarni V.G., and Adlakha V.G. Markov and Markov-Regenerative PERT networks. Oper. Res. 34 5 (1986) 769-781
11. Hagstrom J.N. Computing the probability distribution of project duration in a PERT network. Networks 20 (1990) 231-244
12. Birge J.R., and Louveaux F. Introduction to Stochastic Programming (1997), Springer Verlag, New York
13. van Slyke R.M. Monte Carlo methods and the PERT problem. Oper. Res. 11 (1963) 839-861
14. Burt J.M., and Garman M.B. Conditional Monte Carlo: A simulation technique for stochastic network analysis. Manage. Sci. 18 3 (1971)
15. Sigal C.E., Pritsker A.B., and Solberg J.J. The use of cutsets in Monte Carlo analysis of stochastic networks. Math. Comput. Simuation 21 (1979) 376-384
16. Malcolm D.G., Roseboom J.H., Clark C.E., and Fazar W. Application of a technique for research and development program evaluation. Oper. Res. 7 (1959) 646-669
17. Sculli D. The completion time of PERT networks. J. Oper. Res. Soc. 25 1 (1983) 155-158
18. Clark C.E. The greatest of a finite set of random variables. Oper. Res. 9 (1961) 146-162
19. Dodin B.M., and Sirvanci M. Stochastic networks and the extreme value distribution. Comput. Oper. Res. 17 4 (1990) 207-217
20. Mehrotra K., Chai J., and Pillutla S. A study of approximating the moments of the job completion time in PERT networks. J. Oper. Manage. 14 (1996) 277-289
21. Agrawal M.K., and Elmaghraby S.E. On computing the distribution function of the sum of independent random variables. Comput. Oper. Res. 28 (2001) 473-483
22. Klingel Jr. A.R. Bias in PERT project completion time calculations for a real network. Manage. Sci. 13 4 (1966) 476-489
23. Pontrandolfo P. Project duration in stochastic networks by the PERT-path technique. Int. J. Proj. Manage. 18 (2000) 215-222
24. Yao M., Chu W., and Tseng T. A label-correcting tracing algorithm for the approximation of the probability distribution function of the project completion time. J. Chin. Inst. Ind. Eng. 24 2 (2007) 153-165
25. Bellman R. On a routing problem. Q. Appl. Math. 16 (1958) 88-90
26. Pape U. Implementation and efficiency of Moore-algorithms for the shortest route problem. Math. Program. 7 (1974) 212-222
27. Gallo G., and Pallottino S. Shortest path algorithms. Ann. Oper. Res. 7 (1988) 3-79
28. Glover F., Klingman D., and Philips N. A new polynomial bounded shortest path algorithm. Oper. Res. 33 (1986) 65-73
29. Bertsekas D.P. A simple and fast label correcting algorithm for shortest paths. Networks 23 (1993) 703-709
30. Kolisch R., and Sprecher A. PSPLIB-A project scheduling problem library. European J. Oper. Res. 96 (1996) 205-216