Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/656
Title: Single-machine scheduling with periodic maintenance to minimize makespan
Authors: Ji, Min
He, Yong
Cheng, T. C. Edwin
Subjects: Single-machine scheduling
Periodic maintenance
Nonresumable jobs
Approximation algorithm
Non-approximability
Issue Date: Jun-2007
Publisher: Elsevier Ltd.
Source: Computers & operations research, June 2007, v. 34, no. 6, p. 1764-1770.
Abstract: We consider a single-machine scheduling problem with periodic maintenance activities. Although the scheduling problem with maintenance has attracted researchers' attention, most of past studies considered only one maintenance period. In this research several maintenance periods are considered where each maintenance activity is scheduled after a periodic time interval. The objective is to find a schedule that minimizes the makespan, subject to periodic maintenance and nonresumable jobs. We first prove that the worst-case ratio of the classical LPT algorithm is 2. Then we show that there is no polynomial time approximation algorithm with a worst-case ratio less than 2 unless P=NP, which implies that the LPT algorithm is the best possible.
Rights: Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/656
DOI: 10.1016/j.cor.2005.05.034
ISSN: 0305-0548
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
Periodic_Maintenance_C_OR_V3.pdfPre-published version150.07 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.