Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/476
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorJi, M-
dc.creatorCheng, TCE-
dc.date.accessioned2014-12-11T08:27:37Z-
dc.date.available2014-12-11T08:27:37Z-
dc.identifier.issn0020-0190-
dc.identifier.urihttp://hdl.handle.net/10397/476-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsInformation Processing Letters © 2008 Elsevier. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectEligibilityen_US
dc.subjectGrade of serviceen_US
dc.subjectMakespanen_US
dc.titleAn FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespanen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.identifier.spage171-
dc.identifier.epage174-
dc.identifier.volume108-
dc.identifier.issue4-
dc.identifier.doi10.1016/j.ipl.2008.04.021-
dcterms.abstractWe 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.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationInformation processing letters, Oct. 2008, v. 108, no. 4, p. 171-174-
dcterms.isPartOfInformation processing letters-
dcterms.issued2008-10-31-
dc.identifier.isiWOS:000260355400001-
dc.identifier.scopus2-s2.0-52049106371-
dc.identifier.rosgroupidr43237-
dc.description.ros2008-2009 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
V4_08.02.06.pdfPre-published version149.69 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

173
Last Week
1
Last month
Citations as of Oct 6, 2025

Downloads

282
Citations as of Oct 6, 2025

SCOPUSTM   
Citations

30
Last Week
0
Last month
1
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
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.