MIP Formulations for Flowshop Scheduling with Limited Buffers
From MaRDI portal
Publication:2999340
DOI10.1007/978-3-642-19754-3_14zbMATH Open1325.90040OpenAlexW1533820760MaRDI QIDQ2999340FDOQ2999340
Authors: Janick Frasch, Stephan Westphal, Sven O. Krumke 
Publication date: 12 May 2011
Published in: Theory and Practice of Algorithms in (Computer) Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19754-3_14
Recommendations
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
- Job-shop scheduling with limited capacity buffers
- Batch scheduling in a two-machine flow shop with limited buffer
- Scheduling of a job-shop problem with limited output buffers
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- scientific article; zbMATH DE number 764416
- Block multi-flow shop scheduling with complex buffers
- A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
Cited In (6)
- A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- MILP models for the optimization of real production lines
- Integrated charge batching and casting width selection at Baosteel
- An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
- Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)
This page was built for publication: MIP Formulations for Flowshop Scheduling with Limited Buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999340)
