Semi-online preemptive scheduling: one algorithm for all variants

Number of the records: 1

1.

SYSNO	0370277
Title	Semi-online preemptive scheduling: one algorithm for all variants
Author(s)	Ebenlendr, Tomáš (MU-W)_{SAI, RID} Sgall, J. (CZ)
Source Title	Theory of Computing Systems. Roč. 48, č. 3 (2011), s. 577-613. - : Springer
Conference	26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, 26.02.2009-28.02.2009
Document Type	Článek v odborném periodiku
Grant	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS), CZ - Czech Republic
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	US
Keywords	online algorithms * scheduling * preemption * linear program
URL	http://www.springerlink.com/content/k66u6tv1l7731654/
Permanent Link	http://hdl.handle.net/11104/0204123

	File	Download	Size	Commentary	Version	Access
	Ebenlendr.pdf	1	806.8 KB		Publisher’s postprint	require

Number of the records: 1