Flow shop batching and scheduling with sequence-dependent setup times
From MaRDI portal
Publication:490328
DOI10.1007/s10951-014-0369-xzbMath1305.90200OpenAlexW1967680058MaRDI QIDQ490328
Jatinder N. D. Gupta, Udo Buscher, Liji Shen
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-014-0369-x
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (5)
A comprehensive review of flowshop group scheduling literature ⋮ An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ Family scheduling with batch availability in flow shops to minimize makespan ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
- An iterative approach for the serial batching problem with parallel machines and job families
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- An integrated tabu search algorithm for the lot streaming problem in job shops
- The two-machine sequence dependent flowshop scheduling problem
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- A survey of scheduling problems with setup times or costs
- Flowshop scheduling research after five decades
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
- Flow-shop batch scheduling with identical processing-time jobs
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
- On the Complexity of Scheduling with Batch Setup Times
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell
- The Reactive Tabu Search
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Heuristics and sequence-dependent set-up jobs in flow line cells
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: Flow shop batching and scheduling with sequence-dependent setup times
