The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs

Rubing Chen, Jinjiang Yuan, Yuan Gao. The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs. J. Scheduling, 22(5):581-593, 2019. [doi]

@article{ChenYG19-1,
  title = {The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs},
  author = {Rubing Chen and Jinjiang Yuan and Yuan Gao},
  year = {2019},
  doi = {10.1007/s10951-018-0598-5},
  url = {https://doi.org/10.1007/s10951-018-0598-5},
  researchr = {https://researchr.org/publication/ChenYG19-1},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {22},
  number = {5},
  pages = {581-593},
}