Lower bound for the mean project completion time in dynamic PERT networks
From MaRDI portal
Publication:2462112
DOI10.1016/J.EJOR.2007.01.015zbMath1138.90352OpenAlexW2041579311MaRDI QIDQ2462112
Seyyed Mohammad Taghi Fatemi Ghomi, Amir Azaron
Publication date: 23 November 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.01.015
Stochastic network models in operations research (90B15) Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)
Related Items (1)
Cites Work
- Evaluating project completion times when activity times are Weibull distributed
- A new analytical algorithm and generation of Gaussian quadrature formula for stochastic network
- On criticality and sensitivity in activity networks
- On the fallacy of averages in project risk management
- A new structural mechanism for reducibility of stochastic PERT networks
- A multi-objective resource allocation problem in PERT networks
- Technical Note—Expected Completion Time in Pert Networks
- Computing bounds on project duration distributions for stochastic PERT networks
- Functional estimation of activity criticality indices and sensitivity analysis of expected project completion time
- Markov and Markov-Regenerative <scp>pert</scp> Networks
- Application of a Technique for Research and Development Program Evaluation
- Expected Critical Path Lengths in PERT Networks
- Letter to the Editor—A Modification of Fulkerson's PERT Algorithm
- Critical Path Analyses Via Chance Constrained and Stochastic Programming
- Distribution of the Time Through a Directed, Acyclic Network
- On the Expected Duration of PERT Type Networks
- The exact overall time distribution of a project with uncertain task durations
This page was built for publication: Lower bound for the mean project completion time in dynamic PERT networks
