Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9664032 | European Journal of Operational Research | 2005 | 8 Pages |
Abstract
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 an analysis are given afterwards.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Cherif Sadfi, Bernard Penz, Christophe Rapine, Jacek BÅażewicz, Piotr Formanowicz,