A branch-and-cut approach for the distributed no-wait flowshop scheduling problem

DOI10.1016/J.COR.2022.106009MaRDI QIDQ2676404zbMATH OpenOpenAlexFDO

Authors Mustafa Avci, Mualla Gonca Avci, Alper Hamzadayi

Publication date 27 September 2022

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

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

zbMATH Keywords

branch-and-cutdistributed no-waitflowshop schedulingscheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
• The distributed permutation flowshop scheduling problem
• Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem

Cites work

• A review of TSP based approaches for flowshop scheduling
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• Alternative formulations for a layout problem in the fashion industry
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• Benchmarks for basic scheduling problems
• Flowshop-scheduling problems with makespan criterion: a review
• Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
• scientific article; zbMATH DE number 1769325 (Why is no real title available?)
• Improving Discrete Model Representations via Symmetry Considerations
• Integer Programming Formulation of Traveling Salesman Problems
• Minimizing tardy jobs in a flowshop with common due date
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
• The distributed permutation flowshop scheduling problem
• The Three-Machine No-Wait Flow Shop is NP-Complete
• Variable neighborhood search

Cited in

(5)

• Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
• The distributed no-idle permutation flowshop scheduling problem with due windows
• Transportation infrastructure maintenance planning: an exact column enumeration approach
• A population-based and Q-learning-cooperative iterated greedy algorithm for distributed no-wait job shop problem
• An effective greedy randomized adaptive search procedure-based hybrid metaheuristic for the distributed no-wait flowshop scheduling problem

Describes a project that uses

Uses Software

• LKH

This page was built for publication: A branch-and-cut approach for the distributed no-wait flowshop scheduling problem

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