✦ LIBER ✦

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

✍ Scribed by M.A. Kubzin; V.A. Strusevich; J. Breit; G. Schmidt

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 112 KB
Volume: 53
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.20122

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

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

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