A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints
From MaRDI portal
Publication:2197158
DOI10.1007/S00291-020-00583-ZzbMATH Open1446.90087OpenAlexW3016918675MaRDI QIDQ2197158FDOQ2197158
Authors: Kai Watermeyer, Jürgen Zimmermann 
Publication date: 28 August 2020
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-020-00583-z
Recommendations
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- 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 Generalized Resource-Constrained Project Scheduling Problem
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- Project Scheduling Under Partially Renewable Resource Constraints
branch and boundproject schedulingresource-constrained project schedulingminimum and maximum time lagspartially renewable resources
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- PSPLIB -- a project scheduling problem library
- Network flows. Theory, algorithms, and applications.
- Project Scheduling Under Partially Renewable Resource Constraints
- Measures of the restrictiveness of project networks
- Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems
- Packing chained items in aligned bins with applications to container transshipment and project scheduling
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Solving RCPSP/max by lazy clause generation
- Title not available (Why is that?)
- An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems
- An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations
- Title not available (Why is that?)
- Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
- A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
- A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalised precedence constraints
- A scatter search algorithm for project scheduling under partially renewable resources
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars
- Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling
- Project scheduling with calendars
- Distribution requirements and compactness constraints in school timetabling
- Scheduling the professional soccer leagues of Austria and Germany
- Constraint propagation techniques for the disjunctive scheduling problem
- GRASP and path relinking for project scheduling under partially renewable resources
- Scheduling non-professional table-tennis leagues
- On the strength of time-indexed formulations for the resource-constrained project scheduling problem
Cited In (12)
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
- A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply
- Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag
- Generation schemes for the resource-constrained project scheduling problem with partially renewable resources and generalized precedence constraints
- Exact and truncated branch-and-bound procedures for resource-constrained project scheduling with discounted cash flows and general temporal constraints.
- 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 generalized precedence relations
- Project Scheduling Under Partially Renewable Resource Constraints
- A constructive branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints
- GRASP and path relinking for project scheduling under partially renewable resources
- An updated survey of variants and extensions of the resource-constrained project scheduling problem
- Branch and bound algorithms for resource constrained project scheduling problem subject to nonrenewable resources with prescheduled procurement
Uses Software
This page was built for publication: A branch-and-bound procedure for the resource-constrained project scheduling 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 Q2197158)
