A survey of scheduling with deterministic machine availability constraints

Various deterministic scheduling problems with availability constraints motivated by preventive maintenance attract more and more researchers. Many results involving this constraint have been published in recent years. But there is no recent paper to summarize them. To be convenient for interested researchers, we make this survey. In this paper, complexity results, exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria are surveyed briefly.