TY - JOUR
T1 - Polynomial time approximation algorithms for machine scheduling: ten open problems
AU - Schuurman, P.
AU - Woeginger, G.J.
PY - 1999
Y1 - 1999
N2 - 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.
AB - 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.
U2 - 10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
DO - 10.1002/(SICI)1099-1425(199909/10)2:5<203::AID-JOS26>3.0.CO;2-5
M3 - Article
SN - 1094-6136
VL - 2
SP - 203
EP - 213
JO - Journal of Scheduling
JF - Journal of Scheduling
IS - 5
ER -