Total Completion Time Scheduling under Scenarios (Thomas Bosman, Martijn van Ee, Ekin Ergen, Csanád Imreh, Alberto Marchetti-Spaccamela, Martin Skutella, and Leen Stougie)
Theory Comput. Syst., 69:33, 2025.
Extended abstract appeared in Proc. of WAOA 2023
@article{BosmanEtAl2025,
author = {Bosman, Thomas and van Ee, Martijn and Ergen, Ekin and Imreh, Csan{\'a}d and Marchetti-Spaccamela, Alberto and Skutella, Martin and Stougie, Leen},
journal = {Theory Comput. Syst.},
title = {Total Completion Time Scheduling under Scenarios},
volume = {69},
pages = {33},
year = {2025},
arxiv = {2402.19259},
url = {https://link.springer.com/article/10.1007/s00224-025-10232-z},
}
Online Makespan Scheduling Under Scenarios (Ekin Ergen)
33rd Annual European Symposium on Algorithms (ESA 2025), Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 27:1–27:16.
ESA 2025 Best Student Paper Award
@inproceedings{Ergen2025,
author = {Ergen, Ekin},
title = {{Online Makespan Scheduling Under Scenarios}},
booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
isbn = {978-3-95977-395-9},
issn = {1868-8969},
year = {2025},
volume = {351},
editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian 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.2025.27},
urn = {urn:nbn:de:0030-drops-244950},
doi = {10.4230/LIPIcs.ESA.2025.27},
annote = {Keywords: online scheduling, scenario-based model, online algorithmsarxiv=2507.04016},
}
