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