Lower bound for the mean project completion time in dynamic PERT networks

European Journal of Operational Research

Volumn 186, Issue 1, 2008, Pages 120-127

  Azaron, Amir ^a   Fatemi Ghomi, S M T ^b  

^a DALHOUSIE UNIVERSITY   (Canada)

^b AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

Dynamic programming; Markov processes; Project management and scheduling

Indexed keywords

CONTINUOUS TIME SYSTEMS; DYNAMIC PROGRAMMING; MARKOV PROCESSES; OPTIMIZATION; PERT; RANDOM VARIABLES; SCHEDULING;

DISTRIBUTED RANDOM VARIABLES; PROJECT COMPLETION TIME; STOCHASTIC DYNAMIC PROGRAMMING;

PROJECT MANAGEMENT;

EID: 35349009933     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2007.01.015     Document Type: Article

References (22)

1. Abdelkader Y.H. Evaluating project completion times when activity times are Weibull distributed. European Journal of Operational Research 157 (2004) 704-715
2. Azaron A., Katagiri H., Sakawa M., Kato K., and Memariani A. A multi-objective resource allocation problem in PERT networks. European Journal of Operational Research 172 (2006) 838-854
3. Charnes A., Cooper W., and Thompson G. Critical path analysis via chance constrained and stochastic programming. Operations Research 12 (1964) 460-470
4. Cho J.G., and Yum B.J. Functional estimation of activity criticality indices and sensitivity analysis of expected project completion time. Journal of the Operational Research Society 55 (2004) 850-859
5. Clingen C. A modification of Fulkerson's algorithm for expected duration of a PERT project when activities have continuous d. f. Operations Research 12 (1964) 629-632
6. Elmaghraby S.E. On criticality and sensitivity in activity networks. European Journal of Operational Research 127 (2000) 220-238
7. Elmaghraby S.E. On the expected duration of PERT type networks. Management Science 13 (1967) 299-306
8. Elmaghraby S.E. On the fallacy of averages in project risk management. European Journal of Operational Research 165 (2005) 307-313
9. Fatemi Ghomi S.M.T., and Hashemin S. A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network. European Journal of Operational Research 114 (1999) 610-625
10. Fatemi Ghomi S.M.T., and Rabbani M. A new structural mechanism for reducibility of stochastic PERT networks. European Journal of Operational Research 145 (2003) 394-402
11. Fulkerson D. Expected critical path lengths in PERT networks. Operations Research 10 (1962) 808-817
12. Hardie N. The prediction and control of project duration: A recursive model. International Journal of Project Management 19 (2001) 401-409
13. Howard D. Dynamic Probabilistic Systems (1970), John Wiley & Sons, New York
14. Ieda T. Computing bounds on project duration distributions for stochastic PERT networks. Naval Research Logistics 47 (2000) 559-580
15. J.E. Kelley, M.R. Walker, Critical path planning and scheduling, in: Proc. Eastern Joint Comp. Conf., vol. 16, 1959, pp. 160-172.
16. Kulkarni V., and Adlakha V. Markov and Markov-regenerative PERT networks. Operations Research 34 (1986) 769-781
17. Malcom D.G., Roseboom J.H., Clark C.E., and Fazer W. Application of a technique for research and development program evaluation. Operations Research 7 (1958) 646-669
18. Martin J. Distribution of the time through a directed acyclic network. Operations Research 13 (1965) 46-66
19. Perry C., and Creig I. Estimating the mean and variance of subjective distributions in PERT and decision analysis. Management Science 21 (1975) 1477-1480
20. Pontrandolfo P. Project duration in stochastic networks by the PERT-path technique. International Journal of Project Management 18 (2000) 215-222
21. Robillard P. Expected completion time in PERT networks. Operations Research 24 (1976) 177-182
22. Schmit C., and Grossmann I. The exact overall time distribution of a project with uncertain task durations. European Journal of Operational Research 126 (2000) 614-636