A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints

DOI10.1007/s10951-022-00735-9zbMath1517.90063MaRDI QIDQ6102850

Jürgen Zimmermann, Kai Watermeyer

Publication date: 23 June 2023

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

project schedulingbranch-and-boundminimum and maximum time lagsresource-constrained project schedulingpartially renewable resources

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
• Lower bounds for resource-constrained project scheduling problems.
• Active and stable project scheduling
• Constraint propagation techniques for the disjunctive scheduling problem
• 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
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints
• Project Scheduling Under Partially Renewable Resource Constraints
• Scheduling of Project Networks by Job Assignment
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• 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