Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/653
Title: A simple linear time algorithm for scheduling with step-improving processing times
Authors: Ji, M
He, Y
Cheng, TCE 
Keywords: Scheduling
Approximation algorithm
Worst-case ratio
Issue Date: Aug-2007
Publisher: Pergamon Press
Source: Computers and operations research, Aug. 2007, v. 34, no. 8, p. 2396-2402 How to cite?
Journal: Computers and operations research 
Abstract: We consider the problem of scheduling jobs with step-improving processing times around a common critical date on a single machine to minimize the makespan. For this problem, we present a simple linear time off-line approximation algorithm and prove its worst-case performance guarantee.
URI: http://hdl.handle.net/10397/653
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/j.cor.2005.09.011
Rights: Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
linear_alg_for_step_V5.pdfPre-published version185.11 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Jun 26, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Jun 23, 2017

Page view(s)

268
Last Week
0
Last month
Checked on Jun 25, 2017

Download(s)

248
Checked on Jun 25, 2017

Google ScholarTM

Check

Altmetric



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