Article ID: | iaor20053075 |
Country: | Netherlands |
Volume: | 161 |
Issue: | 1 |
Start Page Number: | 3 |
End Page Number: | 10 |
Publication Date: | Feb 2005 |
Journal: | European Journal of Operational Research |
Authors: | Baewicz Jacek, Penz Bernard, Formanowicz Piotr, Sadfi Cherif, Rapine Christophe |
Keywords: | maintenance, repair & replacement, heuristics |
In this paper, we study the single machine total completion scheduling problem subject to a period of maintenance. We propose an approximation algorithm to solve the problem with a worst case error bound of 3/17. Furthermore, an example is provided to show that the bound is tight. Computational experiments and analysis are given afterwards.