PERT and crashing revisited: Mathematical generalizations
From MaRDI portal
Publication:2366086
DOI10.1016/0377-2217(93)90183-NzbMath0779.90039MaRDI QIDQ2366086
Stephan Foldes, François Soumis
Publication date: 29 June 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items (5)
A network flow algorithm for just-in-time project scheduling ⋮ A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints ⋮ A heuristic procedure for solving the dynamic probabilistic project expediting problem ⋮ A Decomposition Algorithm for Nested Resource Allocation Problems ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods
Cites Work
This page was built for publication: PERT and crashing revisited: Mathematical generalizations