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

We apply the stochastic dynamic programming to obtain a lower bound for the mean project completion time in a PERT network, where the activity durations are exponentially distributed random variables. Moreover, these random variables are non-static in that the distributions themselves vary according to some randomness in society like strike or inflation. This social randomness is modelled as a function of a separate continuous-time Markov process over the time horizon. The results are verified by simulation.

[1]  Ronald A. Howard,et al.  Dynamic Probabilistic Systems , 1971 .

[2]  Yousry H. Abdelkader.  Evaluating project completion times when activity times are Weibull distributed , 2004, Eur. J. Oper. Res..

[3]  Tetsuo Iida.  Computing bounds on project duration distributions for stochastic PERT networks , 2000 .

[4]  C. Perry,et al.  Estimating the Mean and Variance of Subjective Distributions in PERT and Decision Analysis , 1975 .

[5]  D. Malcolm,et al.  Application of a Technique for Research and Development Program Evaluation , 1959 .

[6]  Salah E. Elmaghraby,et al.  On the fallacy of averages in project risk management , 2005, Eur. J. Oper. Res..

[7]  Pierre N. Robillard,et al.  Technical Note - Expected Completion Time in Pert Networks , 1976, Oper. Res..

[8]  S. S. Hashemin,et al.  A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network , 1999, Eur. J. Oper. Res..

[9]  G. Thompson,et al.  Critical Path Analyses Via Chance Constrained and Stochastic Programming , 1964 .

[10]  Amir Azaron,et al.  A multi-objective resource allocation problem in PERT networks , 2006, Eur. J. Oper. Res..

[11]  J. J. Martin.  Distribution of the Time Through a Directed, Acyclic Network , 1965 .

[12]  S. Elmaghraby.  On the Expected Duration of PERT Type Networks , 1967 .

[13]  C. T. Clingen.  Letter to the Editor-A Modification of Fulkerson's PERT Algorithm , 1964 .

[14]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).

[15]  Masoud Rabbani,et al.  A new structural mechanism for reducibility of stochastic PERT networks , 2003, Eur. J. Oper. Res..

[16]  D. R. Fulkerson.  Expected Critical Path Lengths in PERT Networks , 1962 .

[17]  Neil Hardie,et al.  The prediction and control of project duration: a recursive model , 2001 .

[18]  Pierpaolo Pontrandolfo,et al.  Project duration in stochastic networks by the PERT-path technique , 2000 .

[19]  Salah E. Elmaghraby.  On criticality and sensitivity in activity networks , 2000, Eur. J. Oper. Res..

[20]  Ignacio E. Grossmann,et al.  The exact overall time distribution of a project with uncertain task durations , 2000, Eur. J. Oper. Res..

[21]  J.-G. Cho,et al.  Functional estimation of activity criticality indices and sensitivity analysis of expected project completion time , 2004, J. Oper. Res. Soc..

[22]  Vidyadhar G. Kulkarni,et al.  Markov and Markov-Regenerative pert Networks , 1986, Oper. Res..