A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
From MaRDI portal
Publication:3638708
DOI10.1142/S0217595909002328zbMath1172.90407MaRDI QIDQ3638708
Hou-Kuan Chou, Ling-Huey Su, Dar-Li Yang
Publication date: 28 October 2009
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595909002328
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Batch scheduling in a two-machine flow shop with limited buffer
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- The permutation flow shop with buffers: A tabu search approach
- Flowshop sequencing problems with limited buffer storage
- Flowshop scheduling with limited temporary storage
- Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
- Note—Sequencing with Finite Intermediate Storage
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
- Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed