Please use this identifier to cite or link to this item:
Title: Scheduling linear deteriorating jobs with an availability constraint on a single machine
Authors: Ji, Min
He, Yong
Cheng, T. C. Edwin
Subjects: Scheduling
Computational complexity
Approximation algorithms
Deteriorating job
Availability constraint
Issue Date: Oct-2006
Publisher: Elsevier B.V.
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.
Rights: Theoretical Computer Science © 2006 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.tcs.2006.06.006
ISSN: 0304-3975
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
(06.5.12)Final.pdfPre-published version200.18 kBAdobe PDFView/Open

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.