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 |
Issue Date: | Aug-2007 | Source: | Computers and 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. | Keywords: | Scheduling Approximation algorithm Worst-case ratio |
Publisher: | Pergamon Press | Journal: | Computers and operations research | 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 | Size | Format | |
|---|---|---|---|---|
| linear_alg_for_step_V5.pdf | Pre-published version | 185.11 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
90
Last Week
1
1
Last month
Citations as of May 28, 2023
Downloads
356
Citations as of May 28, 2023
SCOPUSTM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of May 25, 2023
WEB OF SCIENCETM
Citations
2
Last Week
0
0
Last month
0
0
Citations as of May 25, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.