Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1228
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | He, Y | - |
dc.creator | Hoogeveen, H | - |
dc.creator | Ji, M | - |
dc.creator | Woeginger, GJ | - |
dc.date.accessioned | 2014-12-11T08:27:32Z | - |
dc.date.available | 2014-12-11T08:27:32Z | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1228 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Operations Research Letters © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Knapsack problem | en_US |
dc.subject | Approximation scheme | en_US |
dc.subject | Competitive analysis | en_US |
dc.title | Scheduling with step-improving processing times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 37 | - |
dc.identifier.epage | 40 | - |
dc.identifier.volume | 34 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1016/j.orl.2005.03.002 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Operations research letters, Jan. 2006, v. 34, no. 1, p. 37-40 | - |
dcterms.isPartOf | Operations research letters | - |
dcterms.issued | 2006-01 | - |
dc.identifier.isi | WOS:000233942600006 | - |
dc.identifier.scopus | 2-s2.0-28044460248 | - |
dc.identifier.eissn | 1872-7468 | - |
dc.identifier.rosgroupid | r25901 | - |
dc.description.ros | 2005-2006 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
step.pdf | Pre-published version | 96.62 kB | Adobe PDF | View/Open |
Page views
155
Last Week
1
1
Last month
Citations as of Mar 24, 2024
Downloads
203
Citations as of Mar 24, 2024
SCOPUSTM
Citations
5
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
9
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.