Two-machine scheduling with periodic availability constraints to minimize makespan

A two-machine scheduling problem where one machine has periodic availability constraints has been studied. The objective is tominimize makepan. For the nonresumable version, we give a better approximation algorithm with performance ratio of $4/3$. For the resumable version, we provide an offline $4/3$-approximation algorithm and an optimal online algorithm, respectively.