Evaluating project completion time in project networks with discrete random activity durations
From MaRDI portal
Publication:1017440
DOI10.1016/J.COR.2008.11.021zbMATH Open1160.90491DBLPjournals/cor/BruniGP09OpenAlexW1973336879WikidataQ58921556 ScholiaQ58921556MaRDI QIDQ1017440FDOQ1017440
Authors: Erika Pinto, Maria Elena Bruni, Francesca Guerriero 
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
Recommendations
- scientific article; zbMATH DE number 1775053
- Computing project makespan distributions: Markovian PERT networks revisited
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- Evaluating Project Completion Times When Activity Times are Erlang Distributed
- A heuristic method for the estimation of the project duration in a stochastic network scheduling
Cites Work
- PSPLIB -- a project scheduling problem library
- Title not available (Why is that?)
- The construction of stable project baseline schedules
- Bounding the Project Completion Time Distribution in PERT Networks
- Heuristics for Scheduling Resource-Constrained Projects: An Experimental Investigation
- 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
- On the fallacy of averages in project risk management
- Computing the probability distribution of project duration in a PERT network
- The Most Critical Path in a PERT Network
- Estimating completion-time distribution in stochastic activity networks
- 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
Cited In (6)
- Estimating completion-time distribution in stochastic activity networks
- Title not available (Why is that?)
- Project duration prediction using a Monte Carlo simulation of the periodic output of the project resources
- Evaluation of the quantiles and superquantiles of the makespan in interval valued activity networks
- Identification and illumination of popular misconceptions about project scheduling and time buffering in a resource-constrained environment
- Competence-based estimation of activity duration in IT projects
Uses Software
This page was built for publication: Evaluating project completion time in project networks with discrete random activity durations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017440)
