License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.8.3.1
URN: urn:nbn:de:0030-drops-92942
Go back to Dagstuhl Reports

Halldórson, Magnús M. ; Megow, Nicole ; Stein, Clifford
Weitere Beteiligte (Hrsg. etc.): Magnús M. Halldórsson and Nicole Megow and Clifford Stein

Scheduling (Dagstuhl Seminar 18101)

dagrep_v008_i003_p001_18101.pdf (11 MB)


This report documents the program and outcomes of the Dagstuhl Seminar 18101 "Scheduling" in March 2018. The seminar brought together algorithmically oriented researchers from two communities with interests in resource management: (i) the scheduling community and (ii) the networking and distributed computing community. The primary objective of the seminar was to expose each community to the important problems and techniques from the other community, and to facilitate dialog and collaboration between researchers.

BibTeX - Entry

  author =	{Magn{\'u}s M. Halld{\'o}rson and Nicole Megow and Clifford Stein},
  title =	{{Scheduling (Dagstuhl Seminar 18101)}},
  pages =	{1--20},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2018},
  volume =	{8},
  number =	{3},
  editor =	{Magn{\'u}s M. Halld{\'o}rsson and Nicole Megow and Clifford Stein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-92942},
  doi =		{10.4230/DagRep.8.3.1},
  annote =	{Keywords: scheduling, optimization, approximation algorithms}

Keywords: scheduling, optimization, approximation algorithms
Collection: Dagstuhl Reports, Volume 8, Issue 3
Issue Date: 2018
Date of publication: 25.07.2018

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI