@InProceedings{hermelin_et_al:LIPIcs.IPEC.2022.18,
author = {Hermelin, Danny and Itzhaki, Yuval and Molter, Hendrik and Shabtay, Dvir},
title = {{Hardness of Interval Scheduling on Unrelated Machines}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-260-0},
ISSN = {1868-8969},
year = {2022},
volume = {249},
editor = {Dell, Holger and Nederlof, Jesper},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.18},
URN = {urn:nbn:de:0030-drops-173748},
doi = {10.4230/LIPIcs.IPEC.2022.18},
annote = {Keywords: Just-in-time scheduling, Parallel machines, Eligible machine sets, W\lbrack1\rbrack-hardness, NP-hardness}
}