Non-approximability results for scheduling problems with minsum criteria

H. Hoogeveen, P. Schuurman, Gerhard Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)
Original languageUndefined
Pages (from-to)157-168
Number of pages12
JournalINFORMS journal on computing
Volume13
Publication statusPublished - 2001

Keywords

  • METIS-202632

Cite this

Hoogeveen, H., Schuurman, P., & Woeginger, G. (2001). Non-approximability results for scheduling problems with minsum criteria. INFORMS journal on computing, 13, 157-168.