A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
DOI10.1007/s00291-021-00654-9zbMath1493.90072OpenAlexW4200514791MaRDI QIDQ2152012
Kai Watermeyer, Jürgen Zimmermann
Publication date: 6 July 2022
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-021-00654-9
project schedulingbranch and boundminimum and maximum time lagsresource-constrained project schedulingpartially renewable resources
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Scheduling non-professional table-tennis leagues
- Distribution requirements and compactness constraints in school timetabling
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
- Modeling and solving a bi-objective airport slot scheduling problem
- GRASP and path relinking for project scheduling under partially renewable resources
- A scatter search algorithm for project scheduling under partially renewable resources
- Scheduling the professional soccer leagues of Austria and Germany
- Going to the core of hard resource-constrained project scheduling instances
- Allocation of partially renewable resources: Concept, capabilities, and applications
- Project Scheduling Under Partially Renewable Resource Constraints
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
This page was built for publication: A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
