✦ LIBER ✦

A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

✍ Scribed by Wieslaw Kubiak

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 273 KB
Volume: 43
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(89)90225-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-machine flow shop no-wait scheduling

Two-machine flow shop no-wait scheduling with a nonavailability interval

✍ Mikhail A. Kubzin; Vitaly A. Strusevich 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

A heuristic for the two-machine no-wait

A heuristic for the two-machine no-wait openshop scheduling problem

✍ Jeffrey B. Sidney; Chelliah Sriskandarajah 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB 👁 2 views

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

Scheduling batches with simultaneous job

Scheduling batches with simultaneous job processing for two-machine shop problems

✍ C. N. Potts; V. A. Strusevich; T. Tautenhahn 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 210 KB 👁 2 views

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.