A new approximation algorithm for obtaining the probability distribution function for project completion time

DOI10.1016/j.camwa.2007.01.036zbMath1235.62149OpenAlexW2020076529WikidataQ126261409 ScholiaQ126261409MaRDI QIDQ2460585

Ming-Jong Yao, Weng-Ming Chu

Publication date: 12 November 2007

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2007.01.036

zbMATH Keywords

discretizationstochastic activity networks

Mathematics Subject Classification ID

Applications of statistics in engineering and industry; control charts (62P30) Monte Carlo methods (65C05) Stochastic scheduling theory in operations research (90B36) Approximations to statistical distributions (nonasymptotic) (62E17)

Related Items (5)

Improving electromagnetism algorithm for solving resource allocation problem in stochastic networks ⋮ Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty ⋮ A new approach to determine the critical path in stochastic activity network ⋮ Distribution of the Activity Time in Network Analysis: A Critical Revisit with a Gamma Alternative ⋮ Evaluating project completion time in project networks with discrete random activity durations

Uses Software

• PSPLIB

Cites Work

• Unnamed Item
• The use of cutsets in Monte Carlo analysis of stochastic networks
• Approximating the distribution functions in stochastic networks
• PSPLIB -- a project scheduling problem library
• Computing the probability distribution of project duration in a PERT network
• On a routing problem
• A New Polynomially Bounded Shortest Path Algorithm
• A Classified Bibliography Of Research On Stochastic Pert Networks: 1966-1987
• The Completion Time of PERT Networks
• A simple and fast label correcting algorithm for shortest paths
• Introduction to Stochastic Programming
• Markov and Markov-Regenerative <scp>pert</scp> Networks
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Application of a Technique for Research and Development Program Evaluation
• Distribution of the Time Through a Directed, Acyclic Network
• The Greatest of a Finite Set of Random Variables
• Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis
• On computing the distribution function of the sum of independent random variables

This page was built for publication: A new approximation algorithm for obtaining the probability distribution function for project completion time