| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428737 | Information Processing Letters | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
