We investigate the single machine scheduling problem with job release dates and due dates, and multiple planned unavailability time periods. This problem arises in the context of machine scheduling with planned preventive maintenance and might be viewed as a generalization of several fundamental single-machine problems. The contribution of this paper is two-fold. First, we propose a new lower bound that is based on the concept of semi-preemptive scheduling. Second, we propose an exact algorithm that requires solving a sequence of one-machine problems without availability constraints.