|
PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >
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, Min
He, Yong
Cheng, T. C. Edwin |
| Subjects: | Scheduling
Approximation algorithm
Worst-case ratio |
| Issue Date: | Aug-2007 |
| Publisher: | Elsevier Ltd. |
| Citation: | Computers & operations research, Aug. 2007, v. 34, no. 8, p. 2396-2402. |
| 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. |
| Description: | 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. |
| Type: | Journal/Magazine Article |
| URI: | http://hdl.handle.net/10397/653 |
| ISSN: | 03050548 |
| Appears in Collections: | LMS Journal/Magazine Articles
|
Locate publisher version via 
|
 Facebook
 del.icio.us
 LinkedIn
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.
|
|
