Flow shop batching and scheduling with sequence-dependent setup times
From MaRDI portal
(Redirected from Publication:490328)
Recommendations
- Family scheduling with batch availability in flow shops to minimize makespan
- Solving the batch scheduling problem with family setup times
- Solving the serial batching problem in job shop manufacturing systems
- Heuristics for permutation flow shop scheduling with batch setup times
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
Cites work
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups
- A single machine scheduling problem with availability constraints and sequence-dependent setup costs
- A survey of scheduling problems with setup times or costs
- An evaluation of group scheduling heuristics in a flow-line manufacturing cell
- An integrated tabu search algorithm for the lot streaming problem in job shops
- An iterative approach for the serial batching problem with parallel machines and job families
- Flow-shop batch scheduling with identical processing-time jobs
- Flowshop scheduling research after five decades
- Heuristics and sequence-dependent set-up jobs in flow line cells
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
- On the Complexity of Scheduling with Batch Setup Times
- Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- The Reactive Tabu Search
- The two-machine sequence dependent flowshop scheduling problem
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
Cited in
(16)- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
- Solving the batch scheduling problem with family setup times
- Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
- A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- 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
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions
- Solving the serial batching problem in job shop manufacturing systems
- A comprehensive review of flowshop group scheduling literature
- Facility layout based on sequence analysis: design of flowshops
- Sequencing CONWIP flow-shops: Analysis and heuristics
- Heuristics for permutation flow shop scheduling with batch setup times
- Family scheduling with batch availability in flow shops to minimize makespan
- Scheduling a flowline manufacturing cell with sequence dependent family setup times
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Sequencing and scheduling in flowshops with task redistribution
This page was built for publication: Flow shop batching and scheduling with sequence-dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490328)
