Two-machine open shop scheduling with an availability constraint. - Joachim Breit; Günter Schmidt 002; Vitaly A. Strusevich (Oper. Res. Lett., 2001)

Two-machine flow shops with limited machine availability. - Wieslaw Kubiak; Jacek Blazewicz; Piotr Formanowicz; Joachim Breit; Günter Schmidt 002 (Eur. J. Oper. Res., 2002)

Non-preemptive two-machine open shop scheduling with non-availability constraints. - Joachim Breit; Günter Schmidt 002; Vitaly A. Strusevich (Math. Methods Oper. Res., 2003)

An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint. - Joachim Breit (Inf. Process. Lett., 2004)

A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint. - Joachim Breit (Comput. Oper. Res., 2006)

Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. - Joachim Breit (Eur. J. Oper. Res., 2007)