Open problems in throughput scheduling

Number of the records: 1

1.

SYSNO ASEP	0387100
Document Type	C - Proceedings Paper (int. conf.)
R&D Document Type	Conference Paper
Title	Open problems in throughput scheduling
Author(s)	Sgall, Jiří (MU-W)_{RID, ORCID, SAI}
Source Title	Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. - Berlin : Springer, 2012 / Epstein L. ; Ferragina P. - ISBN 978-3-642-33089-6
Pages	s. 2-11
Number of pages	10 s.
Publication form	Print - P
Action	20th Annual European Symposium on Algorithms (ESA 2012)
Event date	10.09.2012-12.09.2012
VEvent location	Ljubljana
Country	SI - Slovenia
Event type	WRD
Language	eng - English
Country	DE - Germany
Keywords	problem complexity ; scheduling
Subject RIV	BA - General Mathematics
R&D Projects	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
EID SCOPUS	84866645713
DOI	10.1007/978-3-642-33090-2_2
Annotation	In this talk we survey the area of scheduling with the objective to maximize the throughput, i.e., the (weighted) number of completed jobs. We focus on several open problems.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2013

Number of the records: 1