Article ID: | iaor20082409 |
Country: | United Kingdom |
Volume: | 34 |
Issue: | 6 |
Start Page Number: | 1764 |
End Page Number: | 1770 |
Publication Date: | Jun 2007 |
Journal: | Computers and Operations Research |
Authors: | Cheng T.C. Edwin, He Yong, Ji Min |
Keywords: | maintenance, repair & replacement, computational analysis |
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