Kacem, I.Haouari, Mohamed2012-05-282012-05-282009-031619-4500http://hdl.handle.net/10679/175https://doi.org/10.1007/s10288-008-0076-6Due to copyright restrictions, the access to the full text of this article is only available via subscription.In this paper, we investigate the single machine scheduling problem with release dates and tails and a planned unavailability time period. We show that the problem admits a fully polynomial-time approximation scheme when the tails are equal. We derive an approximation algorithm for the general case and we show that the worst-case bound of the sequence yielded by Schrage’s algorithm is equal to 2 and that this bound is tight. Some consequences of this result are also presented.engrestrictedAccessarticle71799200026483060000710.1007/s10288-008-0076-6SchedulingSingle machineApproximationUnavailability constraint2-s2.0-63949087368