Exact and flexible solution approach to a critical chain project management problem
From MaRDI portal
Publication:823776
DOI10.1007/S10601-020-09314-1zbMath1479.90089OpenAlexW3102133401MaRDI QIDQ823776
Publication date: 16 December 2021
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-020-09314-1
project schedulingmixed integer linear programmingcritical chainexact optimal solutionresource constrained
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Unnamed Item
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Small-\(m\) method for detecting all longest paths
- An investigation of buffer sizing techniques in critical chain scheduling
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
This page was built for publication: Exact and flexible solution approach to a critical chain project management problem