✦ LIBER ✦

Flow-shop problems with intermediate buffers

✍ Scribed by Peter Brucker; Silvia Heitmann; Johann Hurink

Publisher: Springer
Year: 2003
Tongue: German
Weight: 257 KB
Volume: 25
Category: Article
ISSN: 0171-6468
DOI: 10.1007/s00291-003-0133-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A two-machine permutation flow shop sche

A two-machine permutation flow shop scheduling problem with buffers

✍ Czesław Smutnicki 📂 Article 📅 1998 🏛 Springer 🌐 German ⚖ 761 KB

Movement optimization in flow shop proce

Movement optimization in flow shop processing with buffers

✍ Wolfgang Espelage; Egon Wanke 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 186 KB

Job-shop scheduling with limited capacit

Job-shop scheduling with limited capacity buffers

✍ Peter Brucker; Silvia Heitmann; Johann Hurink; Tim Nieberg 📂 Article 📅 2006 🏛 Springer 🌐 German ⚖ 265 KB

A scheduling algorithm for flexible flow

A scheduling algorithm for flexible flow lines with limited intermediate buffers

✍ Sawik, Tadeusz J. 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 681 KB

Flow shop scheduling with earliness, tar

Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs

✍ Kerem Bülbül; Philip Kaminsky; Candace Yano 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.