A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job

Aldar Dugarzhapov, Alexander Kononov. A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job. J. Scheduling, 19(1):61-72, 2016. [doi]

@article{DugarzhapovK16,
  title = {A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job},
  author = {Aldar Dugarzhapov and Alexander Kononov},
  year = {2016},
  doi = {10.1007/s10951-015-0454-9},
  url = {http://dx.doi.org/10.1007/s10951-015-0454-9},
  researchr = {https://researchr.org/publication/DugarzhapovK16},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {19},
  number = {1},
  pages = {61-72},
}