License
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.6.2.97
URN: urn:nbn:de:0030-drops-58902
URL: http://drops.dagstuhl.de/opus/volltexte/2016/5890/
Go back to Dagstuhl Reports


Bansal, Nikhil ; Megow, Nicole ; Stein, Clifford
Weitere Beteiligte (Hrsg. etc.): Nikhil Bansal and Nicole Megow and Clifford Stein

Scheduling (Dagstuhl Seminar 16081)

pdf-format:
dagrep_v006_i002_p097_s16081.pdf (1 MB)


Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 16081 "Scheduling". The seminar was centered around recent new developments, discussion of open problems and exploring future research directions within the broader scheduling community.

BibTeX - Entry

@Article{bansal_et_al:DR:2016:5890,
  author =	{Nikhil Bansal and Nicole Megow and Clifford Stein},
  title =	{{Scheduling (Dagstuhl Seminar 16081)}},
  pages =	{97--118},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{2},
  editor =	{Nikhil Bansal and Nicole Megow and Clifford Stein},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5890},
  URN =		{urn:nbn:de:0030-drops-58902},
  doi =		{10.4230/DagRep.6.2.97},
  annote =	{Keywords: approximation algorithms, scheduling, optimization}
}

Keywords: approximation algorithms, scheduling, optimization
Seminar: Dagstuhl Reports, Volume 6, Issue 2
Issue Date: 2016
Date of publication: 17.08.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI