DROPS

Document

Scheduling (Dagstuhl Seminar 25121)

Authors: Claire Mathieu, Nicole Megow, Benjamin J. Moseley, Frits C. R. Spieksma, and Alexander Lindermayr

Published in: Dagstuhl Reports, Volume 15, Issue 3 (2025)

Abstract

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.

Cite as

Claire Mathieu, Nicole Megow, Benjamin J. Moseley, Frits C. R. Spieksma, and Alexander Lindermayr. Scheduling (Dagstuhl Seminar 25121). In Dagstuhl Reports, Volume 15, Issue 3, pp. 94-112, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@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}
}

Document

DOI: 10.4230/DagRep.13.2.1

Scheduling (Dagstuhl Seminar 23061)

Authors: Nicole Megow, Benjamin J. Moseley, David Shmoys, Ola Svensson, Sergei Vassilvitskii, and Jens Schlöter

Published in: Dagstuhl Reports, Volume 13, Issue 2 (2023)

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 23061 "Scheduling". The seminar focused on the emerging models for beyond-worst case algorithm design, in particular, recent approaches that incorporate learning. This includes models for the integration of learning into algorithm design that have been proposed recently and that have already demonstrated advances in the state-of-art for various scheduling applications: (i) scheduling with error-prone learned predictions, (ii) data-driven algorithm design, and (iii) stochastic and Bayesian learning in scheduling.

Cite as

Nicole Megow, Benjamin J. Moseley, David Shmoys, Ola Svensson, Sergei Vassilvitskii, and Jens Schlöter. Scheduling (Dagstuhl Seminar 23061). In Dagstuhl Reports, Volume 13, Issue 2, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@Article{megow_et_al:DagRep.13.2.1,
  author =	{Megow, Nicole and Moseley, Benjamin J. and Shmoys, David and Svensson, Ola and Vassilvitskii, Sergei and Schl\"{o}ter, Jens},
  title =	{{Scheduling (Dagstuhl Seminar 23061)}},
  pages =	{1--19},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2023},
  volume =	{13},
  number =	{2},
  editor =	{Megow, Nicole and Moseley, Benjamin J. and Shmoys, David and Svensson, Ola and Vassilvitskii, Sergei and Schl\"{o}ter, Jens},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.2.1},
  URN =		{urn:nbn:de:0030-drops-191789},
  doi =		{10.4230/DagRep.13.2.1},
  annote =	{Keywords: scheduling, mathematical optimization, approximation algorithms, learning methods, uncertainty}
}

Search Results

Documents authored by Moseley, Benjamin J.

Scheduling (Dagstuhl Seminar 25121)

Abstract

Cite as

Scheduling (Dagstuhl Seminar 23061)

Abstract

Cite as

Thanks for your feedback!

Could not send message