Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
From MaRDI portal
Publication:2197331
DOI10.1007/S10951-020-00637-8zbMATH Open1446.90072OpenAlexW3008358174MaRDI QIDQ2197331FDOQ2197331
Tolga Bektaş, Alper Hamzadayi, Rubén Ruiz
Publication date: 31 August 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00637-8
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Practical enhancements to the Magnanti-Wong method
- Partitioning procedures for solving mixed-variables programming problems
- Speed-up Benders decomposition using maximum density cut (MDC) generation
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An integrated model for logistics network design
- A comprehensive review and evaluation of permutation flowshop heuristics
- A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- The Three-Machine No-Wait Flow Shop is NP-Complete
- The flow shop problem with no-idle constraints: a review and approximation
- Accelerating benders decomposition with heuristicmaster problem solutions
Cited In (3)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
- An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
This page was built for publication: Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197331)
