Polynomial time approximation algorithms for machine scheduling: ten open problems

P. Schuurman, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

99 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)203-213
Number of pages11
JournalJournal of Scheduling
Volume2
Issue number5
DOIs
Publication statusPublished - 1999

Fingerprint

Dive into the research topics of 'Polynomial time approximation algorithms for machine scheduling: ten open problems'. Together they form a unique fingerprint.

Cite this