A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time

Tianyu Wang, Odile Bellenguez-Morineau. A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time. J. Scheduling, 22(6):709-714, 2019. [doi]

@article{WangB19a,
  title = {A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time},
  author = {Tianyu Wang and Odile Bellenguez-Morineau},
  year = {2019},
  doi = {10.1007/s10951-019-00602-0},
  url = {https://doi.org/10.1007/s10951-019-00602-0},
  researchr = {https://researchr.org/publication/WangB19a},
  cites = {0},
  citedby = {0},
  journal = {J. Scheduling},
  volume = {22},
  number = {6},
  pages = {709-714},
}