A note on the complexity of the concurrent open shop problem

Thomas A. Roemer. A note on the complexity of the concurrent open shop problem. J. Scheduling, 9(4):389-396, 2006. [doi]

@article{Roemer06,
  title = {A note on the complexity of the concurrent open shop problem},
  author = {Thomas A. Roemer},
  year = {2006},
  doi = {10.1007/s10951-006-7042-y},
  url = {http://dx.doi.org/10.1007/s10951-006-7042-y},
  tags = {source-to-source, open-source},
  researchr = {https://researchr.org/publication/Roemer06},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {9},
  number = {4},
  pages = {389-396},
}