On the strength of time-indexed formulations for the resource-constrained project scheduling problem
From MaRDI portal
Publication:1728175
DOI10.1016/j.orl.2017.02.001zbMath1409.90085OpenAlexW2587456227MaRDI QIDQ1728175
Publication date: 22 February 2019
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2017.02.001
resource-constrained project schedulingnon-singular transformationson/off variablesrelaxation strengththe linear programmingtime-indexed variables
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (18)
The sample analysis machine scheduling problem: definition and comparison of exact solving approaches ⋮ Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining ⋮ Robust Capacity Planning for Project Management ⋮ A polyhedral study of event-based models for the resource-constrained project scheduling problem ⋮ A project scheduling problem with periodically aggregated resource-constraints ⋮ An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ Modeling frameworks for the multi‐skill resource‐constrained project scheduling problem: a theoretical and empirical comparison ⋮ An improved decision support model for scheduling production in an engineer-to-order manufacturer ⋮ A branch-and-bound procedure for the resource-constrained project scheduling problem with partially renewable resources and general temporal constraints ⋮ Continuous-time formulations for multi-mode project scheduling ⋮ The multi-mode resource investment problem: a benchmark library and a computational study of lower and upper bounds ⋮ Maximizing the expected net present value in a project with uncertain cash flows ⋮ An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP ⋮ Polyhedral Results and Branch-and-Cut for the Resource Loading Problem ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes ⋮ Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag ⋮ Short- and medium-term optimization of underground mine planning using constraint programming ⋮ A computational study of constraint programming approaches for resource-constrained project scheduling with autonomous learning effects
Cites Work
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- A time indexed formulation of non-preemptive single machine scheduling problems
- Project scheduling. A research handbook.
- Scheduling of resource-constrained projects
- Project scheduling with resource constraints: A branch and bound approach. Note by Frederik Kaefer
- An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation
- On project scheduling with irregular starting time costs
This page was built for publication: On the strength of time-indexed formulations for the resource-constrained project scheduling problem
