approximation scheme

Kubzin, Mikhail A., Strusevich, Vitaly A., Breit, J. and Schmidt, G. (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Research Logistics, 53 (1). pp. 16-23. ISSN 0894-069X (doi:https://doi.org/10.1002/nav.20122)

availability constraints

Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)

machine availability

Kubzin, Mikhail A., Strusevich, Vitaly A., Breit, J. and Schmidt, G. (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Research Logistics, 53 (1). pp. 16-23. ISSN 0894-069X (doi:https://doi.org/10.1002/nav.20122)

open shop

Kubzin, Mikhail A., Strusevich, Vitaly A., Breit, J. and Schmidt, G. (2006) Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints. Naval Research Logistics, 53 (1). pp. 16-23. ISSN 0894-069X (doi:https://doi.org/10.1002/nav.20122)

open shop scheduling

Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)

worst-case analysis

Breit, J., Schmidt, G. and Strusevich, V.A. (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Mathematical Methods of Operations Research, 57 (2). pp. 217-234. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860200267)