Breit, J.; Schmidt, G.; Strusevich, V. A. - In: Mathematical Methods of Operations Research 57 (2003) 2, pp. 217-234
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...
