| Article ID: | iaor2001721 |
| Country: | United Kingdom |
| Volume: | 2 |
| Issue: | 5 |
| Start Page Number: | 203 |
| End Page Number: | 213 |
| Publication Date: | Sep 1999 |
| Journal: | Journal of Scheduling |
| Authors: | Woeginger Gerhard J., Schuurman Petra |
| Keywords: | production |
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.