Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/1228
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.
URI: http://hdl.handle.net/10397/1228
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.03.002
Rights: Operations Research Letters © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
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 full item record

SCOPUSTM   
Citations

1
Citations as of Jun 8, 2016

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
0
Citations as of Sep 8, 2016

Page view(s)

259
Last Week
1
Last month
Checked on Sep 18, 2016

Download(s)

243
Checked on Sep 18, 2016

Google ScholarTM

Check

Altmetric



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