Open problems in the theory of scheduling

G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review


We discuss several open problems in the area of machine scheduling that concern the computational complexity, the off-line approximability, and the on-line approximability of machine scheduling problems. We summarize what is known about these problems, we discuss related results, and we provide many pointers to the literature.
Original languageEnglish
Pages (from-to)67-83
JournalBulletin of the European Association for Theoretical Computer Science, EATCS
Publication statusPublished - 2002


Dive into the research topics of 'Open problems in the theory of scheduling'. Together they form a unique fingerprint.

Cite this