✦ LIBER ✦

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

✍ Scribed by Eugeniusz Nowicki

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 423 KB
Volume: 70
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)90246-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A two-machine flow shop scheduling probl

A two-machine flow shop scheduling problem with controllable job processing times

✍ Eugeniusz Nowicki; Stanisław Zdrzałka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 639 KB

An approximation algorithm for a single-

An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 455 KB

An approximation algorithm for identical

An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

✍ Hans Kellerer 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 119 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.