Mixed 0–1 programming model for three parallel machines scheduling problem with machine-dependent unavailable constraints

We consider a three parallel machines scheduling problem with machine-dependent unavailable constraints where the machines are subject to periodic unavailable constraint, tool change constraint, and flexible periodic unavailable constraint, respectively. The objective is to minimize makespan, i.e., the completion time of the last finished job. We present a mixed 0-1 programming model with computational experiments for the problem.