Joachim Breit

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...

Heuristische Ablaufplanungsverfahren für Flowshops und Openshops mit beschränkt verfügbaren Prozessoren / (2000)

Breit, Joachim.

Saarbrücken, Univ., Diss., 2001.

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint

Breit, Joachim

Two-machine flow shops with limited machine availability

Kubiak, Wieslaw, Blazewicz, Jacek, Formanowicz, Piotr, Breit, Joachim, Schmidt, Gunter