Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1228
DC FieldValueLanguage
dc.contributor.authorCheng, TCEen_US
dc.contributor.authorHe, Yen_US
dc.contributor.authorHoogeveen, Hen_US
dc.contributor.authorJi, Men_US
dc.contributor.authorWoeginger, GJen_US
dc.date.accessioned2014-12-11T08:27:32Z-
dc.date.available2014-12-11T08:27:32Z-
dc.date.issued2006-01-
dc.identifier.citationOperations research letters, Jan. 2006, v. 34, no. 1, p. 37-40en_US
dc.identifier.issn0167-6377-
dc.identifier.urihttp://hdl.handle.net/10397/1228-
dc.description.abstractWe consider the scheduling problem of minimizing the makespan on a single machine with step-improving job processing times around a common critical date. For this problem we give an NP-hardness proof, a fast pseudo-polynomial time algorithm, an FPTAS, and an on-line algorithm with best possible competitive ratio.en_US
dc.description.sponsorshipDepartment of Logistics and Maritime Studiesen_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofOperations research lettersen_US
dc.rightsOperations Research Letters © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectKnapsack problemen_US
dc.subjectApproximation schemeen_US
dc.subjectCompetitive analysisen_US
dc.titleScheduling with step-improving processing timesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage37-
dc.identifier.epage40-
dc.identifier.volume34-
dc.identifier.issue1-
dc.identifier.doi10.1016/j.orl.2005.03.002-
dc.identifier.isiWOS:000233942600006-
dc.identifier.scopus2-s2.0-28044460248-
dc.identifier.eissn1872-7468-
dc.identifier.rosgroupidr25901-
dc.description.ros2005-2006 > Academic research: refereed > Publication in refereed journal-
dc.description.oapreprint_postprint-
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
step.pdfPre-published version96.62 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show simple item record
PIRA download icon_1.1View/Download Contents

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Nov 30, 2019

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Dec 2, 2019

Page view(s)

373
Last Week
1
Last month
Citations as of Dec 4, 2019

Download(s)

322
Citations as of Dec 4, 2019

Google ScholarTM

Check

Altmetric


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