@InProceedings{heeger_et_al:LIPIcs.ESA.2024.68,
author = {Heeger, Klaus and Hermelin, Danny},
title = {{Minimizing the Weighted Number of Tardy Jobs Is W\lbrack1\rbrack-Hard}},
booktitle = {32nd Annual European Symposium on Algorithms (ESA 2024)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-338-6},
ISSN = {1868-8969},
year = {2024},
volume = {308},
editor = {Chan, Timothy and Fischer, Johannes and Iacono, John and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.68},
URN = {urn:nbn:de:0030-drops-211392},
doi = {10.4230/LIPIcs.ESA.2024.68},
annote = {Keywords: single-machine scheduling, number of different weights, number of different processing times}
}