Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/476
| Title: | An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan | Authors: | Ji, M Cheng, TCE |
Issue Date: | 31-Oct-2008 | Source: | Information processing letters, Oct. 2008, v. 108, no. 4, p. 171-174 | 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. | Keywords: | Scheduling Eligibility Grade of service Makespan |
Publisher: | Elsevier | Journal: | Information processing letters | ISSN: | 0020-0190 | DOI: | 10.1016/j.ipl.2008.04.021 | Rights: | Information Processing Letters © 2008 Elsevier. The journal web site is located at http://www.sciencedirect.com. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| V4_08.02.06.pdf | Pre-published version | 149.69 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
173
Last Week
1
1
Last month
Citations as of Oct 6, 2025
Downloads
282
Citations as of Oct 6, 2025
SCOPUSTM
Citations
30
Last Week
0
0
Last month
1
1
Citations as of Dec 19, 2025
WEB OF SCIENCETM
Citations
26
Last Week
0
0
Last month
1
1
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.