Please use this identifier to cite or link to this item:
Title: Scheduling with step-improving processing times
Authors: Cheng, T. C. Edwin
He, Yong
Hoogeveen, Han
Ji, Min
Woeginger, Gerhard J.
Subjects: 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.
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.
Rights: Operations Research Letters © 2005 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.orl.2005.03.002
ISSN: 0167-6377
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
step.pdfPre-published version96.62 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.