A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops

Jianming Dong, Ruyan Jin, Jueliang Hu, Guohui Lin. A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops. J. Comb. Optim., 37(2):668-684, 2019. [doi]

@article{DongJHL19,
  title = {A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops},
  author = {Jianming Dong and Ruyan Jin and Jueliang Hu and Guohui Lin},
  year = {2019},
  doi = {10.1007/s10878-018-0314-6},
  url = {https://doi.org/10.1007/s10878-018-0314-6},
  researchr = {https://researchr.org/publication/DongJHL19},
  cites = {0},
  citedby = {0},
  journal = {J. Comb. Optim.},
  volume = {37},
  number = {2},
  pages = {668-684},
}