Suche auf der Schloss Dagstuhl Webseite
Sie suchen nach Informationen auf den Webseiten der einzelnen Seminare? - Dann:
Nicht fündig geworden? - Einige unserer Dienste laufen auf separaten Webseiten mit jeweils eigener Suche. Bitte beachten Sie folgende Liste:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Innerhalb dieser Seite:
Externe Seiten:
  • DOOR (zum Registrieren eines Dagstuhl Aufenthaltes)
  • DOSA (zum Beantragen künftiger Dagstuhl Seminare oder Dagstuhl Perspektiven Workshops)
Innerhalb dieser Seite:
Externe Seiten:
Innerhalb dieser Seite:
Externe Seiten:
  • die Informatik-Bibliographiedatenbank dblp

Dagstuhl-Seminar 23061


( 05. Feb – 10. Feb, 2023 )

(zum Vergrößern in der Bildmitte klicken)

Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:



Gemeinsame Dokumente



Scheduling is a major research field that is studied from a practical and theoretical perspective in computer science, mathematical optimization and operations research. Applications range from traditional production scheduling and project planning to the newly arising resource management tasks in the area of internet technology such as distributed cloud service networks and the allocation of virtual machines to physical servers. Algorithms for scheduling problems have been one of the richest areas of algorithmic research, spanning nearly 70 years of work. Throughout, research has been prompted by the fact that in most settings, these computational problems are quite challenging, and new approaches and frameworks are continually being added to help tackle a broadening portfolio of scheduling problems.

At this Dagstuhl Seminar, we focus on the emerging models for beyond-worst case algorithm design, in particular, recent approaches that incorporate learning. Several models for the integration of learning into algorithm design have been proposed and have already demonstrated advances in the state-of-art for various scheduling applications. This seminar will focus on three established themes:

  1. Scheduling with error-prone learned predictions
  2. Data-driven algorithm design
  3. Stochastic and bayesian learning in scheduling

The seminar aims to bring together researchers working on distinct areas to encourage cross-fertilization among different research directions. As the field of learning is very broad, we methodologically focus on the theoretical design of algorithms with provable performance guarantees.

Copyright Nicole Megow, Benjamin J. Moseley, David Shmoys, Ola Svensson, and Sergei Vassilvitskii


Verwandte Seminare
  • Dagstuhl-Seminar 08071: Scheduling (2008-02-10 - 2008-02-15) (Details)
  • Dagstuhl-Seminar 10071: Scheduling (2010-02-14 - 2010-02-19) (Details)
  • Dagstuhl-Seminar 13111: Scheduling (2013-03-10 - 2013-03-15) (Details)
  • Dagstuhl-Seminar 16081: Scheduling (2016-02-21 - 2016-02-26) (Details)
  • Dagstuhl-Seminar 18101: Scheduling (2018-03-04 - 2018-03-09) (Details)
  • Dagstuhl-Seminar 20081: Scheduling (2020-02-16 - 2020-02-21) (Details)

  • Data Structures and Algorithms
  • Machine Learning

  • scheduling
  • mathematical optimization
  • approximation algorithms
  • learning methods
  • uncertainty