Tomás Ebenlendr

Publication Activity (10 Years)

Years Active: 2004-2015
Publications (10 Years): 0

Top Topics

Scheduling Jobs

Processing Times

Parallel Machines

Top Venues

Theory Comput. Syst.

Publications

Tomás Ebenlendr, Jirí Sgall
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption. Theory Comput. Syst. 56 (1) (2015)
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines. Algorithmica 68 (1) (2014)
Tomás Ebenlendr, Jirí Sgall
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption. WAOA (2011)
Tomás Ebenlendr, Jirí Sgall
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Theory Comput. Syst. 48 (3) (2011)
Tomás Ebenlendr, Jirí Sgall
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. STACS (2009)
Ondrej Zajícek, Jirí Sgall, Tomás Ebenlendr
Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput. PPAM (2) (2009)
Tomás Ebenlendr, Jirí Sgall
Optimal and online preemptive scheduling on uniformly related machines. J. Sched. 12 (5) (2009)
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. Algorithmica 53 (4) (2009)
Tomás Ebenlendr
Semi-online Preemptive Scheduling: Study of Special Cases. PPAM (2) (2009)
Tomás Ebenlendr, Marek Krcál, Jirí Sgall
Graph balancing: a special case of scheduling unrelated parallel machines. SODA (2008)
Tomás Ebenlendr, Jirí Sgall
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines. WAOA (2008)
Jihuan Ding, Tomás Ebenlendr, Jirí Sgall, Guochuan Zhang
Online Scheduling of Equal-Length Jobs on Parallel Machines. ESA (2007)
Tomás Ebenlendr, Wojciech Jawor, Jirí Sgall
Preemptive Online Scheduling: Optimal Algorithms for All Speeds. ESA (2006)
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
A Note on Semi-online Machine Covering. WAOA (2005)
Tomás Ebenlendr, Jirí Sgall
Optimal and Online Preemptive Scheduling on Uniformly Related Machines. STACS (2004)