Solution algorithms for synchronous flow shop problems with two dominating machines
From MaRDI portal
Publication:342451
DOI10.1016/j.cor.2016.04.010zbMath1349.90360OpenAlexW2339303351MaRDI QIDQ342451
Stefan Waldherr, Matthias Kampmeyer, Sigrid Knust
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.04.010
Related Items (3)
Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines ⋮ Decomposition algorithms for synchronous flow shop problems with additional resources and setup times ⋮ Synchronous flow shop scheduling with pliable jobs
Uses Software
Cites Work
- Unnamed Item
- Complexity results for flow shop problems with synchronous movement
- An approximation algorithm for a bottleneck traveling salesman problem
- Recognition of Gilmore-Gomory traveling salesman problem
- Polyhedral results for a vehicle routing problem
- Gilmore-Gomory type traveling salesman problems
- Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
- Flowshop scheduling with dominant machines
- On Gilmore-Gomory's open question for the bottleneck TSP.
- New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
- No-wait or no-idle permutation flowshop scheduling with dominating machines
- An exponential (matching based) neighborhood for the vehicle routing problem
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Integer Programming Formulation of Traveling Salesman Problems
- A New Formulation for the Travelling Salesman Problem
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Column Generation
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Flow shop-sequencing problem with synchronous transfers and makespan minimization
This page was built for publication: Solution algorithms for synchronous flow shop problems with two dominating machines
