✦ LIBER ✦

Makespan minimization in open shops: A polynomial time approximation scheme

✍ Scribed by Sergey V. Sevastianov; Gerhard J. Woeginger

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 510 KB
Volume: 82
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01585871

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

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

Minimizing expected makespan in a two-ma

Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival

✍ Chia-Shin Chung; Bidhu B Mohanty 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 517 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

Minimizing the makespan in open-shop sch

Minimizing the makespan in open-shop scheduling problems with a convex resource consumption function

✍ Dvir Shabtay; Moshe Kaspi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB

Minimizing the sum of weighted completio

Minimizing the sum of weighted completion times in a concurrent open shop

✍ Monaldo Mastrolilli; Maurice Queyranne; Andreas S. Schulz; Ola Svensson; Nelson 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 315 KB