Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
DOI10.1007/s10479-023-05788-3zbMATH Open1545.9007MaRDI QIDQ6588473
Jürgen Zimmermann, Mareike Karnebogen
Publication date: 15 August 2024
Published in: Annals of Operations Research (Search for Journal in Brave)
project schedulinggeneralized precedence constraintspartially renewable resourcesgeneration schemesRCPSP/max
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Distribution requirements and compactness constraints in school timetabling
- A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- GRASP and path relinking for project scheduling under partially renewable resources
- A scatter search algorithm for project scheduling under partially renewable resources
- Project Scheduling Under Partially Renewable Resource Constraints
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
This page was built for publication: Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
