Polynomial-time approximation schemes for two-machine open shops scheduling with nonavailability constraints

back to overview

Reference

Kubzin, M., Breit, J., Schmidt, G., & Strusevich, V. (2005). Polynomial-time approximation schemes for two-machine open shops scheduling with nonavailability constraints. Naval Research Logistics. (ABDC_2016: B; ABDC_2019: B; ABS_2018: 3; ABS_2021: 3; ISI_2016: 0.753; ISI_2016_5year: 1.033; VHB_3: B)

Publication type

Article in Scientific Journal

Persons

Organizational Units

  • Institute of Information Systems