Family scheduling with batch availability in flow shops to minimize makespan
From MaRDI portal
Recommendations
- Flow shop batching and scheduling with sequence-dependent setup times
- 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
- Batching and scheduling in a multi-machine flow shop
Cites work
- A comprehensive review of flowshop group scheduling literature
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A note on flow-shop and job-shop batch scheduling with identical processing-time jobs
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour
- An integrated tabu search algorithm for the lot streaming problem in job shops
- Batch sizing and job sequencing on a single machine
- Flow shop batching and scheduling with sequence-dependent setup times
- 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
- One-machine batching and sequencing of multiple-type items
- Open-shop batch scheduling with identical jobs
- 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
- Scheduling a two-stage hybrid flowshop with separable setup and removal times
- Scheduling and lot streaming in flowshops with no-wait in process
- Scheduling Groups of Jobs on a Single Machine
- Scheduling with batching: A review
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Single machine scheduling with batch deliveries
- The complexity of one-machine batching problems
- The Reactive Tabu Search
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
Cited in
(10)- Heuristics for permutation flow shop scheduling with batch setup times
- Solving the serial batching problem in job shop manufacturing systems
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Impact of family-based scheduling on transfer batches in a job shop manufacturing cell
- Flow shop batching and scheduling with sequence-dependent setup times
- scientific article; zbMATH DE number 6402606 (Why is no real title available?)
- Solving the batch scheduling problem with family setup times
- Preface
- Learning-augmented heuristics for scheduling parallel serial-batch processing machines
- A note: on the two-stage flowshop with dedicated machines to minimize total load
This page was built for publication: Family scheduling with batch availability in flow shops to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1743654)
