✦ LIBER ✦

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

✍ Scribed by Joachim Breit

Book ID: 108105668
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 202 KB
Volume: 33
Category: Article
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.01.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time approximation schemes fo

Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints

✍ M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

An approximation scheme for two-machine

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

✍ Xiuli Wang; T.C. Edwin Cheng 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 177 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| • |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves

Improved approximation for non-preemptiv

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

✍ Joachim Breit 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 192 KB

An improved heuristic for two-machine fl

An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs

✍ Hatem Hadda; Najoua Dridi; Sonia Hajri-Gabouj 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 258 KB

An improved algorithm for the two machin

An improved algorithm for the two machine flow shop problem with several availability constraints

✍ Hatem Hadda 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 256 KB