✦ LIBER ✦

The three-machine flow-shop problem with arbitrary precedence relations

✍ Scribed by Chong John Lim; Graham B. McMahon

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 440 KB
Volume: 78
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90384-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The two-machine flow shop problem with a

The two-machine flow shop problem with arbitrary precedence relations

✍ Graham B. McMahon; Chong-John Lim 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 542 KB

The connection between the bump number p

The connection between the bump number problem and flow-shop scheduling with precedence constraints

✍ G. Steiner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 361 KB

An approximation algorithm for the m-mac

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 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.