Search results
- 1.0440693 - MÚ 2015 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
A lower bound on deterministic online algorithms for scheduling on related machines without preemption.
Theory of Computing Systems. Roč. 56, č. 1 (2015), s. 73-81. ISSN 1432-4350. E-ISSN 1433-0490
R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online algorithms * scheduling * makespan
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.719, year: 2015
http://link.springer.com/article/10.1007%2Fs00224-013-9451-6
Permanent Link: http://hdl.handle.net/11104/0243792File Download Size Commentary Version Access Ebenlendr.pdf 1 398.7 KB Publisher’s postprint require - 2.0424769 - MÚ 2014 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Krčál, M. - Sgall, J.
Graph balancing: a special case of scheduling unrelated parallel machines.
Algorithmica. Roč. 68, č. 1 (2014), s. 62-80. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA ČR GBP202/12/G061; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : approximation algorithms * weighted outdegree * orientation
Subject RIV: BA - General Mathematics
Impact factor: 0.791, year: 2014
http://link.springer.com/article/10.1007%2Fs00453-012-9668-9
Permanent Link: http://hdl.handle.net/11104/0230789File Download Size Commentary Version Access Ebenlendr.pdf 1 644.3 KB Publisher’s postprint require - 3.0370277 - MÚ 2012 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
Semi-online preemptive scheduling: one algorithm for all variants.
Theory of Computing Systems. Roč. 48, č. 3 (2011), s. 577-613. ISSN 1432-4350. E-ISSN 1433-0490.
[26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, 26.02.2009-28.02.2009]
R&D Projects: GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : online algorithms * scheduling * preemption * linear program
Subject RIV: BA - General Mathematics
Impact factor: 0.442, year: 2011
http://www.springerlink.com/content/k66u6tv1l7731654/
Permanent Link: http://hdl.handle.net/11104/0204123File Download Size Commentary Version Access Ebenlendr.pdf 1 806.8 KB Publisher’s postprint require - 4.0334960 - MÚ 2010 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Jawor, W. - Sgall, Jiří
Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
[Preemptivní online rozvrhování: optimální algoritmy pro všechny rychlosti.]
Algorithmica. Roč. 53, č. 4 (2009), s. 504-522. ISSN 0178-4617. E-ISSN 1432-0541
R&D Projects: GA MŠMT(CZ) 1M0545; GA ČR GA201/05/0124; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : anline algorithms * scheduling
Subject RIV: IN - Informatics, Computer Science
Impact factor: 0.917, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179564File Download Size Commentary Version Access Ebenlendr1.pdf 1 435.2 KB Publisher’s postprint require - 5.0334957 - MÚ 2010 RIV US eng J - Journal Article
Ebenlendr, Tomáš - Sgall, J.
Optimal and online preemptive scheduling on uniformly related machines.
[Optimální a online preemptivní rozvrhování na uniformních počítačích.]
Journal of Scheduling. Roč. 12, č. 5 (2009), s. 517-527. ISSN 1094-6136. E-ISSN 1099-1425
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : online scheduling * preemption * uniformly related machines
Subject RIV: IN - Informatics, Computer Science
Impact factor: 1.265, year: 2009
Permanent Link: http://hdl.handle.net/11104/0179562File Download Size Commentary Version Access Ebenlendr.pdf 1 424.8 KB Publisher’s postprint require