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, M He, Y Cheng, TCE |
Issue Date: | Jun-2007 | Source: | Computers and 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. | Keywords: | Single-machine scheduling Periodic maintenance Nonresumable jobs Approximation algorithm Non-approximability |
Publisher: | Pergamon Press | Journal: | Computers and operations research | ISSN: | 0305-0548 | EISSN: | 1873-765X | DOI: | 10.1016/j.cor.2005.05.034 | Rights: | Computers & Operations Research © 2005 Elsevier Ltd. The journal web site is located at http://www.sciencedirect.com. |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Periodic_Maintenance_C_OR_V3.pdf | Pre-published version | 150.07 kB | Adobe PDF | View/Open |
Page views
146
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
654
Citations as of Apr 21, 2024
SCOPUSTM
Citations
160
Last Week
1
1
Last month
5
5
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
129
Last Week
0
0
Last month
2
2
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.