Abstract
We consider the m parallel-machine scheduling problem that process service requests from various customers who are entitled to different levels of grade of service (GoS). The objective is to minimize the makespan. We give a fully polynomial-time approximation scheme for the case where m is fixed.
Original language | English |
---|---|
Pages (from-to) | 171-174 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 108 |
Issue number | 4 |
DOIs | |
Publication status | Published - 31 Oct 2008 |
Keywords
- Eligibility
- Grade of service
- Makespan
- Scheduling
ASJC Scopus subject areas
- Computational Theory and Mathematics