Efficient Estimation of Arc Criticalities in Stochastic Activity Networks
From MaRDI portal
Publication:4838072
DOI10.1287/mnsc.41.1.58zbMath0829.90056OpenAlexW2167714357MaRDI QIDQ4838072
Publication date: 4 July 1995
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.41.1.58
Stochastic network models in operations research (90B15) Deterministic scheduling theory in operations research (90B35)
Related Items (9)
A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing ⋮ Distributionally robust mixed integer linear programs: persistency models with applications ⋮ Least Squares Approximation to the Distribution of Project Completion Times with Gaussian Uncertainty ⋮ Modeling and simulation of project management through the PMBOK\(^{\circledR}\) standard using complex networks ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ Mixture densities for project management activity times: A robust approach to PERT ⋮ A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming ⋮ Project risk management from the bottom-up: activity risk index ⋮ On criticality and sensitivity in activity networks
This page was built for publication: Efficient Estimation of Arc Criticalities in Stochastic Activity Networks