An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval
We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Althou...