A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint

Weitian Tong, Yao Xu, Huili Zhang. A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint. Theoretical Computer Science, 922:438-446, 2022. [doi]

@article{TongXZ22,
  title = {A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint},
  author = {Weitian Tong and Yao Xu and Huili Zhang},
  year = {2022},
  doi = {10.1016/j.tcs.2022.04.044},
  url = {https://doi.org/10.1016/j.tcs.2022.04.044},
  researchr = {https://researchr.org/publication/TongXZ22},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {922},
  pages = {438-446},
}