✦ LIBER ✦

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Scribed by Petra Schuurman; Gerhard J. Woeginger

Publisher: Springer US
Year: 1999
Tongue: English
Weight: 91 KB
Volume: 2
Category: Article
ISSN: 1094-6136
DOI: 10.1002/(sici)1099-1425(199909/10)2:5<203::aid-jos26>3.0.co;2-5

No coin nor oath required. For personal study only.

✦ Synopsis

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. Copyright