License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10071.2
URN: urn:nbn:de:0030-drops-25417
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2541/
Go to the corresponding Portal

Albers, Susanne ; Baruah, Sanjoy K. ; Möhring, Rolf H. ; Pruhs, Kirk

10071 Executive Summary -- Scheduling

pdf-format:
10071.SWM.Paper.2541.pdf (0.06 MB)

Abstract

The primary objectives of this seminar were to bring together leading
researchers working on scheduling problems in three different research
communities -- operations research, theoretical computer science, and
real-time systems -- to expose each community to the important problems
addressed by the other communities; to enable and encourage cooperation
among the researchers; and to facilitate a transfer of solution techniques
from each community to the others.

BibTeX - Entry

@InProceedings{albers_et_al:DagSemProc.10071.2,
  author =	{Albers, Susanne and Baruah, Sanjoy K. and M\"{o}hring, Rolf  H. and Pruhs, Kirk},
  title =	{{10071 Executive Summary – Scheduling}},
  booktitle =	{Scheduling},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10071},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2541},
  URN =		{urn:nbn:de:0030-drops-25417},
  doi =		{10.4230/DagSemProc.10071.2},
  annote =	{Keywords: Scheduling, real-time, complexity, approximation algorithms}
}

Keywords: Scheduling, real-time, complexity, approximation algorithms
Collection: 10071 - Scheduling
Issue Date: 2010
Date of publication: 03.05.2010

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