✦ LIBER ✦

A flow-shop problem with sequence-dependent additive setup times

✍ Scribed by Wlodzimierz Szwarc; Jatinder N. D. Gupta

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 388 KB
Volume: 34
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198710)34:5<619::aid-nav3220340503>3.0.co;2-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition methods for reentrant flow

Decomposition methods for reentrant flow shops with sequence-dependent setup times

✍ Ebru Demirkol; Reha Uzsoy 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 345 KB

We consider the problem of scheduling a reentrant #ow shop with sequence-dependent setup times to minimize maximum lateness. We develop a series of decomposition methods (DMs) exploring the importance of components such as subproblem solution method, bottleneck identi"cation and reoptimization metho

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.