PolyU IR
 

PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >

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, Min
Cheng, T. C. Edwin
Subjects: Scheduling
Eligibility
Grade of service
Makespan
Issue Date: 31-Oct-2008
Publisher: Elsevier
Citation: 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.
Description: 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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/476
ISSN: 00200190
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
V4_08.02.06.pdfPre-published version149.69 kBAdobe PDFView/Open
Locate publisher version via PolyU eLinks



Facebook Facebook del.icio.us del.icio.us LinkedIn LinkedIn


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.

 

© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback