Polynomial time approximation algorithms for machine scheduling: ten open problems

P. Schuurman, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

101 Citations (Scopus)

Fingerprint

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

Business & Economics

Engineering & Materials Science