Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/628
PIRA download icon_1.1View/Download Full Text
Title: Scheduling linear deteriorating jobs with an availability constraint on a single machine
Authors: Ji, M
He, Y
Cheng, TCE 
Issue Date: Oct-2006
Source: Theoretical computer science, Oct. 2006, v. 362, no. 1-3, p. 115-126
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.
Keywords: Scheduling
Computational complexity
Approximation algorithms
Deteriorating job
Availability constraint
Publisher: Elsevier
Journal: Theoretical computer science 
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.06.006
Rights: Theoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
(06.5.12)Final.pdfPre-published version200.18 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

129
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

158
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

80
Last Week
0
Last month
1
Citations as of Mar 28, 2024

WEB OF SCIENCETM
Citations

74
Last Week
0
Last month
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.