Benders decomposition for a period-aggregated resource leveling problem with variable job duration
From MaRDI portal
Publication:2668707
DOI10.1016/j.cor.2021.105258OpenAlexW3135677017MaRDI QIDQ2668707
Alain Haït, Olga Battaïa, Ilia Tarasov
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105258
Uses Software
Cites Work
- A rough-cut capacity planning model with overlapping
- Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
- MIP models for resource-constrained project scheduling with flexible resource profiles
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound
- A priority-rule method for project scheduling with work-content constraints
- Scheduling subject to resource constraints: Classification and complexity
- Partitioning procedures for solving mixed-variables programming problems
- Resource-constrained project scheduling with flexible resource profiles in continuous time
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Ground stations networks for free-space optical communications: maximizing the data transfer
- The Benders decomposition algorithm: a literature review
- Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem
- Mixed-integer linear programming for resource leveling problems
- Large-scale influence maximization via maximal covering location
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
- Logic-based Benders decomposition for scheduling a batching machine
- An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Implementing Automatic Benders Decomposition in a Modern MIP Solver
This page was built for publication: Benders decomposition for a period-aggregated resource leveling problem with variable job duration
