Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
From MaRDI portal
Publication:670464
DOI10.1155/2017/9452762zbMath1437.90077OpenAlexW2724851396WikidataQ59145194 ScholiaQ59145194MaRDI QIDQ670464
Geraldo Robson Mateus, Francisco Regis Abreu Gomes
Publication date: 18 March 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/9452762
Related Items
A robust optimization approach for the unrelated parallel machine scheduling problem ⋮ Corrigendum to: ``Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Large-scale mixed integer programming: Benders-type heuristics
- A hybrid method for the planning and scheduling
- An integrated method for planning and scheduling to minimize tardiness
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- Practical enhancements to the Magnanti-Wong method
- Improving Benders decomposition using a genetic algorithm
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Partitioning procedures for solving mixed-variables programming problems
- Minimizing average completion time in the presence of release dates
- Logic-based Benders decomposition
- Local branching
- A polyhedral approach to single-machine scheduling problems.
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- On generating maximal nondominated Benders cuts
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- A Benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture
- Single-facility scheduling by logic-based Benders decomposition
- The significance of reducing setup times/setup costs
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Accelerating Benders Decomposition by Local Branching
- Planning and Scheduling by Logic-Based Benders Decomposition
- Accelerating Benders method using covering cut bundle generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Multicommodity Distribution System Design by Benders Decomposition
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
