Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
From MaRDI portal
Publication:1935550
DOI10.1007/s10288-012-0205-0zbMath1264.90085OpenAlexW2008516453MaRDI QIDQ1935550
Massimiliano Caramia, Lucio Bianco
Publication date: 18 February 2013
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-012-0205-0
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
An updated survey of variants and extensions of the resource-constrained project scheduling problem ⋮ A priority based assignment problem ⋮ An alternate approach to solve two-level priority based assignment problem
Cites Work
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- The Analysis of Activity Networks Under Generalized Precedence Relations (GPRs)
- Unnamed Item
This page was built for publication: Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm
