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 
Keywords: Scheduling
Eligibility
Grade of service
Makespan
Issue Date: 31-Oct-2008
Publisher: Elsevier
Source: Information processing letters, Oct. 2008, v. 108, no. 4, p. 171-174 How to cite?
Journal: Information processing letters 
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.
URI: http://hdl.handle.net/10397/476
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 SizeFormat 
V4_08.02.06.pdfPre-published version149.69 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

18
Last Week
0
Last month
2
Citations as of Jun 5, 2016

WEB OF SCIENCETM
Citations

18
Last Week
0
Last month
1
Citations as of Dec 7, 2016

Page view(s)

455
Last Week
3
Last month
Checked on Dec 4, 2016

Download(s)

732
Checked on Dec 4, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.