@InProceedings{eberle_et_al:LIPIcs.ESA.2020.41,
author = {Eberle, Franziska and Megow, Nicole and Schewior, Kevin},
title = {{Optimally Handling Commitment Issues in Online Throughput Maximization}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.41},
URN = {urn:nbn:de:0030-drops-129076},
doi = {10.4230/LIPIcs.ESA.2020.41},
annote = {Keywords: Deadline scheduling, throughput, online algorithms, competitive analysis}
}