Non-preemptive two-machine open shop scheduling with non-availability constraints

Joachim Breit, G. Schmidt, Vitaly A. Strusevich. Non-preemptive two-machine open shop scheduling with non-availability constraints. Math. Meth. of OR, 57(2):217-234, 2003. [doi]

@article{BreitSS03,
  title = {Non-preemptive two-machine open shop scheduling with non-availability constraints},
  author = {Joachim Breit and G. Schmidt and Vitaly A. Strusevich},
  year = {2003},
  doi = {10.1007/s001860200267},
  url = {http://dx.doi.org/10.1007/s001860200267},
  researchr = {https://researchr.org/publication/BreitSS03},
  cites = {0},
  citedby = {0},
  journal = {Math. Meth. of OR},
  volume = {57},
  number = {2},
  pages = {217-234},
}