An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem

DOI10.1016/J.COR.2020.105006zbMATH Open1458.90302OpenAlexW3034045556MaRDI QIDQ2664346FDOQ2664346

Authors: Alper Hamzadayi 

Publication date: 20 April 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105006

Recommendations

• The distributed permutation flowshop scheduling problem
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
• Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints

zbMATH Keywords

mixed integer linear programmingBenders decomposition algorithmdistributed flowshop problemLS3 algorithmNEH2\_en algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

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
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An integrated model for logistics network design
• The Complexity of Flowshop and Jobshop Scheduling
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• The distributed permutation flowshop scheduling problem
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• Approximation algorithms for the parallel flow shop problem
• Decomposition-based algorithms for the crew scheduling and routing problem in road restoration
• Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures
• Parallel flowshop scheduling using Tabu search
• A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
• Minimizing tardy jobs in a flowshop with common due date
• An FPTAS for the parallel two-stage flowshop problem
• Minimizing due date related performance measures on two batch processing machines
• A new rule for minimizing the number of tardy jobs in dynamic flow shops
• The Benders decomposition algorithm: a literature review
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources
• Accelerating Benders decomposition with heuristic master problem solutions
• The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
• Corrigendum to: ``An FPTAS for the parallel two-stage flowshop problem

Cited In (11)

• Comparative approaches to equipment scheduling in high volume factories
• New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
• A review and classification on distributed permutation flowshop scheduling problems
• Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation
• A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
• An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times
• Matheuristic for the decentralized factories scheduling problem
• Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
• Simultaneous selection factories, assignment products to factories, lot-sizing and scheduling in distributed permutation flow shop

This page was built for publication: An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664346)