A comment on parallel-machine scheduling under a grade of service provision to minimize makespan

Research output: Contribution to journalArticleAcademicpeer-review

8 Citations (Scopus)
1 Downloads (Pure)

Abstract

We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed number of machines subject to a grade of service provision. Both results substantially simplify a recent construction by Ji and Cheng [IPL 108 (2008) 171–174].
Original languageEnglish
Pages (from-to)341-342
JournalInformation Processing Letters
Volume109
Issue number7
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'A comment on parallel-machine scheduling under a grade of service provision to minimize makespan'. Together they form a unique fingerprint.

  • Cite this