Evaluating project completion time in project networks with discrete random activity durations

DOI10.1016/j.cor.2008.11.021zbMath1160.90491DBLPjournals/cor/BruniGP09OpenAlexW1973336879WikidataQ58921556 ScholiaQ58921556MaRDI QIDQ1017440

Erika Pinto, Francesca Guerriero, Maria Elena Bruni

Publication date: 19 May 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.021

zbMATH Keywords

uncertaintyproject managementscenariosproject risk analysis

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)

Related Items (1)

Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks

Uses Software

• PSPLIB
• CPLEX
• AIMMS

Cites Work

• Unnamed Item
• PSPLIB -- a project scheduling problem library
• On the fallacy of averages in project risk management
• The construction of stable project baseline schedules
• A solution approach to find the critical path in a time-constrained activity network
• A new approximation algorithm for obtaining the probability distribution function for project completion time
• Computing the probability distribution of project duration in a PERT network
• Bounding the Project Completion Time Distribution in PERT Networks
• Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
• The Most Critical Path in a PERT Network
• Application of a Technique for Research and Development Program Evaluation
• Expected Critical Path Lengths in PERT Networks
• Critical Path Analyses Via Chance Constrained and Stochastic Programming
• Estimating completion-time distribution in stochastic activity networks

This page was built for publication: Evaluating project completion time in project networks with discrete random activity durations