Non-Preemptive Two-Machine Open Shop Scheduling (2001)
Joachim Breit, Gnter Schmidt, Vitaly A. Strusevich
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...
Saarbrücken, Univ., Diss., 2001.