Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines

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]

Abstract

Abstract is missing.