Martin Koutecký, Johannes Zink. Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines. In Yixin Cao 0001, Siu-Wing Cheng, Minming Li, editors, 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference). Volume 181 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]
@inproceedings{KouteckyZ20,
title = {Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines},
author = {Martin Koutecký and Johannes Zink},
year = {2020},
doi = {10.4230/LIPIcs.ISAAC.2020.18},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2020.18},
researchr = {https://researchr.org/publication/KouteckyZ20},
cites = {0},
citedby = {0},
booktitle = {31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
editor = {Yixin Cao 0001 and Siu-Wing Cheng and Minming Li},
volume = {181},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-173-3},
}