In the literature, some works deal with the two-machine flow shop scheduling problem under availability constraints. Most of them consider those constraints only for one machine at a time and also with limited unavailability periods. In this work, we were interested by the unlimited periodic and synchronized maintenance applied on both machines. The problem is NP-hard. We proposed a mixed integer programming model and a variable neighborhood search for solving large instances in order to minimize the makespan. Computational experiments show the efficiency of the proposed methods.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.