Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/628
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Ji, M | - |
dc.creator | He, Y | - |
dc.creator | Cheng, TCE | - |
dc.date.accessioned | 2014-12-11T08:24:42Z | - |
dc.date.available | 2014-12-11T08:24:42Z | - |
dc.identifier.issn | 0304-3975 | - |
dc.identifier.uri | http://hdl.handle.net/10397/628 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Theoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Computational complexity | en_US |
dc.subject | Approximation algorithms | en_US |
dc.subject | Deteriorating job | en_US |
dc.subject | Availability constraint | en_US |
dc.title | Scheduling linear deteriorating jobs with an availability constraint on a single machine | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 115 | - |
dc.identifier.epage | 126 | - |
dc.identifier.volume | 362 | - |
dc.identifier.issue | 1-3 | - |
dc.identifier.doi | 10.1016/j.tcs.2006.06.006 | - |
dcterms.abstract | We consider a single machine scheduling problem in which the processing time of a job is a simple linear increasing function of its starting time and the machine is subject to an availability constraint. We consider the non-resumable case. The objectives are to minimize the makespan and the total completion time. We show that both problems are NP-hard and present pseudo-polynomial time optimal algorithms to solve them. Furthermore, for the makespan problem, we present an optimal approximation algorithm for the on-line case, and a fully polynomial time approximation scheme for the off-line case. For the total completion time problem, we provide a heuristic and evaluate its efficiency by computational experiments. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Theoretical computer science, Oct. 2006, v. 362, no. 1-3, p. 115-126 | - |
dcterms.isPartOf | Theoretical computer science | - |
dcterms.issued | 2006-10 | - |
dc.identifier.isi | WOS:000241117900008 | - |
dc.identifier.scopus | 2-s2.0-33748547219 | - |
dc.identifier.rosgroupid | r31395 | - |
dc.description.ros | 2006-2007 > 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 | |
---|---|---|---|---|
(06.5.12)Final.pdf | Pre-published version | 200.18 kB | Adobe PDF | View/Open |
Page views
135
Last Week
1
1
Last month
Citations as of Apr 21, 2024
Downloads
158
Citations as of Apr 21, 2024
SCOPUSTM
Citations
80
Last Week
0
0
Last month
1
1
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
74
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.