Tomáš Ebenlendr

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A lower bound on deterministic online algorithms for scheduling on related machines without preemption Theory of Computing Systems	2015-05-12	Paper
Graph balancing: a special case of scheduling unrelated parallel machines Algorithmica	2014-03-25	Paper
A lower bound on deterministic online algorithms for scheduling on related machines without preemption Approximation and Online Algorithms	2012-07-16	Paper
Semi-online preemptive scheduling: one algorithm for all variants	2012-04-24	Paper
Semi-online preemptive scheduling: one algorithm for all variants Theory of Computing Systems	2011-05-23	Paper
Semi-online preemptive scheduling: study of special cases Parallel Processing and Applied Mathematics	2010-08-17	Paper
scientific article; zbMATH DE number 5764783 (Why is no real title available?)	2010-08-06	Paper
Optimal and online preemptive scheduling on uniformly related machines Journal of Scheduling	2009-12-02	Paper
Preemptive online scheduling: Optimal algorithms for all speeds Algorithmica	2009-05-06	Paper
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines Approximation and Online Algorithms	2009-02-12	Paper
Online Scheduling of Equal-Length Jobs on Parallel Machines Algorithms – ESA 2007	2008-09-25	Paper
Preemptive Online Scheduling: Optimal Algorithms for All Speeds Lecture Notes in Computer Science	2008-03-11	Paper
STACS 2004 Lecture Notes in Computer Science	2007-10-01	Paper
Approximation and Online Algorithms Lecture Notes in Computer Science	2007-02-12	Paper

Research outcomes over time

This page was built for person: Tomáš Ebenlendr