Tianyu Wang, Odile Bellenguez-Morineau. The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints. J. Scheduling, 22(3):263-269, 2019. [doi]
@article{WangB19-4,
title = {The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints},
author = {Tianyu Wang and Odile Bellenguez-Morineau},
year = {2019},
doi = {10.1007/s10951-018-0596-7},
url = {https://doi.org/10.1007/s10951-018-0596-7},
researchr = {https://researchr.org/publication/WangB19-4},
cites = {0},
citedby = {0},
journal = {J. Scheduling},
volume = {22},
number = {3},
pages = {263-269},
}