✦ LIBER ✦

Completion times in multipurpose batch plants with set-up, transfer and clean-up times

✍ Scribed by Raimon Grau; Antonio Espuña; Luís Puigjaner

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 452 KB
Volume: 20
Category: Article
ISSN: 0098-1354
DOI: 10.1016/0098-1354(96)00198-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completion times in serial mixed-storage

Completion times in serial mixed-storage multiproduct processes with transfer and set-up times

✍ D. Rajagopalan; I.A. Karimi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 855 KB

Completion times algorithm of multi-prod

Completion times algorithm of multi-product batch processes for common intermediate storage policy (CIS) with nonzero transfer and set-up times

✍ J.H. Jung; H.-K. Lee; I.-B. Lee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB

Completion times and optimal scheduling

Completion times and optimal scheduling for serial multi-product processes with transfer and set-up times in zero-wait policy

✍ Jae Hak Jung; Ho-Kyung Lee; Dae Ryook Yang; In-Beum Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Approximation algorithms for single-mach

Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times

✍ Stanisłlaw Zdrzałka 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 616 KB

A polynomial-time approximation scheme f

A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times

✍ Gerhard J. Woeginger 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 100 KB 👁 3 views

We investigate the single-machine sequencing problem in which each job has a processing time and a delivery time. The jobs are divided into families and a set-up time is incurred whenever there is a switch from a job in one family to a job in another family. This set-up only depends on the family of