Benders decomposition for the mixed no-idle permutation flowshop scheduling problem

DOI10.1007/S10951-020-00637-8MaRDI QIDQ2197331zbMATHOpenAlexFDO

Authors Tolga Bektaş, Rubén Ruiz, Alper Hamzadayi

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

zbMATH Keywords

flowshop schedulingBenders decompositionmixed no-idlereferenced local search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
• Single-facility scheduling by logic-based Benders decomposition

Cites work

• 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
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Accelerating Benders decomposition with heuristic master problem solutions
• An integrated model for logistics network design
• Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
• Partitioning procedures for solving mixed-variables programming problems
• Practical enhancements to the Magnanti-Wong method
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• The Three-Machine No-Wait Flow Shop is NP-Complete
• The flow shop problem with no-idle constraints: a review and approximation

Cited in

(3)

• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion

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)