Creative Commons Attribution 4.0 International license
This report documents the program and outcomes of Dagstuhl Seminar 25121, "Scheduling". The seminar focused on bridging traditional algorithmic scheduling with the emerging field of fairness in resource allocation. Scheduling is a longstanding research area that has been studied from both practical and theoretical perspectives in computer science, mathematical optimization, and operations research for over 70 years. Fairness has become a key concern in recent years, particularly in the context of resource allocation and scheduling, where it naturally arises in applications such as kidney exchange, school choice, and political districting. The seminar centered on three main themes: (1) fair allocation, (2) fairness versus quality of service, and (3) modeling aspects of fairness in scheduling.
@Article{mathieu_et_al:DagRep.15.3.94,
author = {Mathieu, Claire and Megow, Nicole and Moseley, Benjamin J. and Spieksma, Frits C. R. and Lindermayr, Alexander},
title = {{Scheduling (Dagstuhl Seminar 25121)}},
pages = {94--112},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2025},
volume = {15},
number = {3},
editor = {Mathieu, Claire and Megow, Nicole and Moseley, Benjamin J. and Spieksma, Frits C. R. and Lindermayr, Alexander},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.3.94},
URN = {urn:nbn:de:0030-drops-248981},
doi = {10.4230/DagRep.15.3.94},
annote = {Keywords: scheduling, fairness, mathematical optimization, algorithms and complexity, uncertainty}
}