Approximating the Criticality Indices of the Activities in PERT Networks
From MaRDI portal
Publication:3747216
DOI10.1287/mnsc.31.2.207zbMath0607.90044OpenAlexW1986361321MaRDI QIDQ3747216
Salah E. Elmaghraby, Bajis Dodin
Publication date: 1985
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.31.2.207
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items (18)
Risk taking in stochastic PERT networks ⋮ A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ Distributionally robust mixed integer linear programs: persistency models with applications ⋮ A new heuristic for resource-constrained project scheduling in stochastic networks using critical chain concept ⋮ Probabilistic shortest path problems with budgetary constraints ⋮ A classified bibliography of recent research relating to project risk management ⋮ 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 ⋮ Introduction of criticality indices into PERT instruction ⋮ Project bidding under deterministic and probabilistic activity durations ⋮ Project risk management from the bottom-up: activity risk index ⋮ A linear Bayesian stochastic approximation to update project duration estimates ⋮ Approximating probability density functions and their convolutions using orthogonal polynomials ⋮ Path critical index and activity critical index in PERT networks ⋮ On criticality and sensitivity in activity networks ⋮ Optimal scheduling of purchasing orders for large projects ⋮ A new structural mechanism for reducibility of stochastic PERT networks
This page was built for publication: Approximating the Criticality Indices of the Activities in PERT Networks
