Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
From MaRDI portal
Publication:342351
DOI10.1016/j.cor.2016.01.017zbMath1349.90310OpenAlexW2262841629MaRDI QIDQ342351
Young-Jin An, Seong-Woo Choi, Yeong-Dae Kim
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.01.017
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Three-machine flow shop scheduling with overlapping waiting time constraints ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Scheduling for a flow shop with waiting time constraints and missing operations in semiconductor manufacturing ⋮ A genetic algorithm for a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Two-machine flow shop scheduling problems with minimal and maximal delays
- Minimizing total tardiness on a two-machine re-entrant flowshop
- The two-machine sequence dependent flowshop scheduling problem
- Minimizing total tardiness in permutation flowshops
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Optimal two- and three-stage production schedules with setup times included
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- A branch-and-bound algorithm for a two-machine flowshop scheduling problem with limited waiting time constraints
- Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- New heuristics for flow shop problem to minimize makespan
- Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Minimizing makespan on a two-machine re-entrant flowshop
- Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
- Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
This page was built for publication: Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
