Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/475
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/475-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsInformation Processing Letters © 2006 Elsevier. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectMachine schedulingen_US
dc.subjectStart time-dependent processing timesen_US
dc.subjectMakespanen_US
dc.subjectApproximation algorithmsen_US
dc.titleAn FPTAS for scheduling with piecewise linear decreasing processing times to minimize makespanen_US
dc.typeJournal/Magazine Articleen_US
dc.description.otherinformationAuthor name used in this publication: T. C. E. Chengen_US
dc.identifier.spage41-
dc.identifier.epage47-
dc.identifier.volume102-
dc.identifier.issue2-3-
dc.identifier.doi10.1016/j.ipl.2006.11.014-
dcterms.abstractWe study the problems of scheduling a set of nonpreemptive jobs on a single machine and identical parallel machines, where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objective is to minimize makespan. We first give a fully polynomial-time approximation scheme (FPTAS) for the case with a single machine. We then generalize the result to the case with m identical machines.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationAn FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan. Information processing letters, Apr. 2007, v. 102, no. 2-3, p. 41-47-
dcterms.isPartOfInformation processing letters-
dcterms.issued2007-04-30-
dc.identifier.isiWOS:000244994100001-
dc.identifier.scopus2-s2.0-33847251040-
dc.identifier.rosgroupidr34921-
dc.description.ros2006-2007 > 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_06[1].11.21.pdfPre-published version159.81 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

158
Last Week
1
Last month
Citations as of Aug 13, 2025

Downloads

195
Citations as of Aug 13, 2025

SCOPUSTM   
Citations

19
Last Week
0
Last month
1
Citations as of Sep 12, 2025

WEB OF SCIENCETM
Citations

16
Last Week
0
Last month
0
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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