✦ LIBER ✦

Makespan Minimization in No-Wait Flow Shops: A Polynomial Time Approximation Scheme

✍ Scribed by Sviridenko, M.

Book ID: 118198866
Publisher: Society for Industrial and Applied Mathematics
Year: 2003
Tongue: English
Weight: 149 KB
Volume: 16
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480100370803

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan minimization in open shops: A p

Makespan minimization in open shops: A polynomial time approximation scheme

✍ Sergey V. Sevastianov; Gerhard J. Woeginger 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 510 KB

Makespan Minimization in Job Shops: A Li

Makespan Minimization in Job Shops: A Linear Time Approximation Scheme

✍ Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 167 KB

Heuristic for no-wait flow shops with ma

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

✍ XiaoPing Li; Cheng Wu 📂 Article 📅 2008 🏛 Science in China Press (SCP) 🌐 English ⚖ 252 KB

A constructive heuristic for minimizing

A constructive heuristic for minimizing makespan in no-wait flow shop scheduling

✍ Dipak Laha; Uday K. Chakraborty 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 219 KB

Makespan minimization in a no-wait flow

Makespan minimization in a no-wait flow shop problem with two batching machines

✍ Ammar Oulamara 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Minimizing the makespan in the two-machi

Minimizing the makespan in the two-machine no-wait flow-shop with limited machine availability

✍ M.L. Espinouse; P. Formanowicz; B. Penz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 307 KB

This paper deals with the two-machine no-wait flow-shop problem with limited machine availability. In this model, we assume that machines may not always be available, for example because of preventive maintenance. We only consider the deterministic case where the unavailable periods are known in adv