Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines von Ebenlendr, Tomáš, Krčál, Marek, Sgall, Jiří

Volltext

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines Without Preemption von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Semi-Online Preemptive Scheduling: One Algorithm for All Variants von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Optimal and online preemptive scheduling on uniformly related machines von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Semi-online Preemptive Scheduling: Study of Special Cases von Ebenlendr, Tomáš

Volltext

Preemptive Online Scheduling: Optimal Algorithms for All Speeds von Ebenlendr, Tomáš, Jawor, Wojciech, Sgall, Jiří

Volltext

A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Preemptive Online Scheduling: Optimal Algorithms for All Speeds von Ebenlendr, Tomáš, Jawor, Wojciech, Sgall, Jiří

Volltext

A Note on Semi-online Machine Covering von Ebenlendr, Tomáš, Noga, John, Sgall, Jiří, Woeginger, Gerhard

Volltext

A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Optimal and Online Preemptive Scheduling on Uniformly Related Machines von Ebenlendr, Tomáš, Sgall, Jiří

Volltext

Optimal and online preemptive scheduling onuniformlyrelatedmachines von Ebenlendr, Tomas, Sgall, Jiri

Volltext

Online Scheduling of Equal-Length Jobs on Parallel Machines von Ding, Jihuan, Ebenlendr, Tomáš, Sgall, Jiří, Zhang, Guochuan

Volltext

Online Scheduling of Parallel Jobs on Hypercubes: Maximizing the Throughput von Zajíček, Ondřej, Sgall, Jiří, Ebenlendr, Tomáš

Volltext