Please use this identifier to cite or link to this item:
Title: Scheduling with step-improving processing times
Authors: Cheng, TCE 
He, Y
Hoogeveen, H
Ji, M
Woeginger, GJ
Keywords: Scheduling
Knapsack problem
Approximation scheme
Competitive analysis
Issue Date: Jan-2006
Publisher: Elsevier
Source: Operations research letters, Jan. 2006, v. 34, no. 1, p. 37-40 How to cite?
Journal: Operations research letters 
Abstract: We 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.
ISSN: 0167-6377
EISSN: 1872-7468
DOI: 10.1016/j.orl.2005.03.002
Rights: Operations Research Letters © 2005 Elsevier B.V. The journal web site is located at
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
step.pdfPre-published version96.62 kBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record
PIRA download icon_1.1View/Download Contents

Google ScholarTM



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