Non-preemptive two-machine open shop scheduling with non-availability constraints
- Cite this article as:
- Breit, J., Schmidt, G. & Strusevich, V. Mathematical Methods of OR (2003) 57: 217. doi:10.1007/s001860200267
We study a two-machine open shop scheduling problem, in which the machines are not continuously available for processing. No preemption is allowed in the processing of any operation. The objective is to minimize the makespan. We consider approximability issues of the problem with more than one non-availability intervals and present an approximation algorithm with a worst-case ratio of 4/3 for the problem with a single non-availability interval.