approximation algorithm

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1998) Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 48 (3). pp. 359-375. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860050033)

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)

job shop scheduling

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1998) Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 48 (3). pp. 359-375. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860050033)

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)

Drobouchevitch, Inna G. and Strusevich, Vitaly A. (1998) Heuristics for short route job shop scheduling problems. Mathematical Methods of Operations Research, 48 (3). pp. 359-375. ISSN 1432-2994 (Print), 1432-5217 (Online) (doi:https://doi.org/10.1007/s001860050033)