Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1834
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorLi, CL-
dc.creatorWang, X-
dc.date.accessioned2014-12-11T08:25:30Z-
dc.date.available2014-12-11T08:25:30Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/1834-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2009 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectParallel machinesen_US
dc.subjectRelease timesen_US
dc.subjectWorst-case analysisen_US
dc.subjectPolynomial time approximation schemeen_US
dc.titleScheduling parallel machines with inclusive processing set restrictions and job release timesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage702-
dc.identifier.epage710-
dc.identifier.volume200-
dc.identifier.issue3-
dc.identifier.doi10.1016/j.ejor.2009.02.011-
dcterms.abstractWe consider the problem of scheduling a set of jobs with different release times on parallel machines so as to minimize the makespan of the schedule. The machines have the same processing speed, but each job is compatible with only a subset of those machines. The machines can be linearly ordered such that a higher-indexed machine can process all those jobs that a lower-indexed machine can process. We present an efficient algorithm for this problem with a worst-case performance ratio of 2. We also develop a polynomial time approximation scheme (PTAS) for the problem, as well as a fully polynomial time approximation scheme (FPTAS) for the case in which the number of machines is fixed.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 1 Feb. 2010, v. 200, no. 3, p. 702-710-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2010-02-01-
dc.identifier.isiWOS:000270701200008-
dc.identifier.scopus2-s2.0-69749107598-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr48886-
dc.description.ros2009-2010 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
63 Final-Version.pdfPre-published version219.15 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

136
Last Week
0
Last month
Citations as of Mar 24, 2024

Downloads

306
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

29
Last Week
0
Last month
0
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

26
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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