Determining the K Most Critical Paths in PERT Networks
From MaRDI portal
Publication:3337928
DOI10.1287/opre.32.4.859zbMath0546.90045MaRDI QIDQ3337928
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
90B35: Deterministic scheduling theory in operations research
Related Items
A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing, A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept, A heuristic procedure for solving the dynamic probabilistic project expediting problem, Approximating probability density functions and their convolutions using orthogonal polynomials, The most critical path in a PERT network: A heuristic approach, A new structural mechanism for reducibility of stochastic PERT networks, Risk taking in stochastic PERT networks