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 QIDQ2152012FDOQ2152012

Authors 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

zbMATH Keywords

branch and boundproject schedulingresource-constrained project schedulingminimum and maximum time lagspartially renewable resources

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A constructive 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
• A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem
• A branch-and-bound algorithm for the resource-constrained project scheduling problem
• A branch and bound algorithm for the resource-constrained project scheduling problem
• Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
• A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
• scientific article; zbMATH DE number 34437
• A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem

Cites work

• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
• A scatter search algorithm for project scheduling under partially renewable resources
• Allocation of partially renewable resources: Concept, capabilities, and applications
• 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
• Distribution requirements and compactness constraints in school timetabling
• GRASP and path relinking for project scheduling under partially renewable resources
• Going to the core of hard resource-constrained project scheduling instances
• Modeling and solving a bi-objective airport slot scheduling problem
• Network flows. Theory, algorithms, and applications.
• Packing chained items in aligned bins with applications to container transshipment and project scheduling
• ProGen/\(\pi x\) -- An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions
• Project Scheduling Under Partially Renewable Resource Constraints
• Scheduling non-professional table-tennis leagues
• Scheduling the professional soccer leagues of Austria and Germany
• Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling

Cited in

(5)

• Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
• GRASP and path relinking for project scheduling under partially renewable resources
• New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms
• A constructive 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

Describes a project that uses

Uses Software

• PSPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152012)