Determining the K Most Critical Paths in PERT Networks

DOI10.1287/opre.32.4.859zbMath0546.90045OpenAlexW2118170736MaRDI QIDQ3337928

Bajis Dodin

Publication date: 1984

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.32.4.859

zbMATH Keywords

PERT networksproject planningmost critical pathstochastic dominance to

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Risk taking in stochastic PERT networks ⋮ A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ The most critical path in a PERT network: A heuristic approach ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept ⋮ 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 ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Approximating probability density functions and their convolutions using orthogonal polynomials ⋮ A new structural mechanism for reducibility of stochastic PERT networks

This page was built for publication: Determining the K Most Critical Paths in PERT Networks