Scheduling flexible flow lines with no in-process buffers
From MaRDI portal
Publication:4398979
Recommendations
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- scientific article; zbMATH DE number 1998826
- Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 2
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
Cites work
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Branch and bound algorithm for the flow shop with multiple processors
- Flowshop sequencing problems with limited buffer storage
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Scheduling with deadlines and loss functions
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
Cited in
(16)- A memetic algorithm for the flexible flow line scheduling problem with processor blocking
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
- Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis
- Scheduling flexible flow lines with sequence-dependent setup times
- A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
- Scheduling a two stage proportionate flexible flow shop with dedicated machines and no buffers
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- scientific article; zbMATH DE number 1998826 (Why is no real title available?)
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- The hybrid flow shop scheduling problem
- A taxonomy of flexible flow line scheduling procedures
- The interface of buffer design and cyclic scheduling decisions in deterministic flow lines
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
This page was built for publication: Scheduling flexible flow lines with no in-process buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4398979)