2026-07-22T15:56:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24898 2026-02-09T12:30:29Z ddc:004 open_access

Scheduling (Dagstuhl Seminar 25121) Mathieu, Claire Megow, Nicole Moseley, Benjamin J. Spieksma, Frits C. R. Lindermayr, Alexander scheduling fairness mathematical optimization algorithms and complexity uncertainty 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Claire Mathieu and Nicole Megow and Benjamin J. Moseley and Frits C. R. Spieksma and Alexander Lindermayr 2025 Is Part Of Dagstuhl Reports, Volume 15, Issue 3 (2025) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.15.3.94 urn:nbn:de:0030-drops-248981 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.3.94 eng https://creativecommons.org/licenses/by/4.0/legalcode