Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/672
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:24:49Z-
dc.date.available2014-12-11T08:24:49Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/672-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsCopyright © 2007 Elsevier B.V.en_US
dc.subjectParallel-machine schedulingen_US
dc.subjectDeteriorating jobsen_US
dc.subjectFPTASen_US
dc.titleParallel-machine scheduling with simple linear deterioration to minimize total completion timeen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage342-
dc.identifier.epage347-
dc.identifier.volume188-
dc.identifier.issue2-
dc.identifier.doi10.1016/j.ejor.2007.04.050-
dcterms.abstractWe consider the parallel-machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the total completion time. We give a fully polynomial-time approximation scheme (FPTAS) for the case with m identical machines, where m is fixed. This study solves an open problem that has been posed in the literature for ten years.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 16 July 2008, v. 188, no. 2, p. 342-347-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2008-07-16-
dc.identifier.isiWOS:000253183500003-
dc.identifier.scopus2-s2.0-38149101038-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr37271-
dc.description.ros2007-2008 > 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 
V6_06.11.15.pdfPre-published version150.05 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

128
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

245
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

73
Last Week
1
Last month
2
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

66
Last Week
0
Last month
1
Citations as of Apr 25, 2024

Google ScholarTM

Check

Altmetric


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