Tomáš Ebenlendr

From MaRDI portal
Person:537920

Available identifiers

zbMath Open ebenlendr.tomasMaRDI QIDQ537920

List of research outcomes





PublicationDate of PublicationType
A lower bound on deterministic online algorithms for scheduling on related machines without preemption2015-05-12Paper
Graph balancing: a special case of scheduling unrelated parallel machines2014-03-25Paper
A lower bound on deterministic online algorithms for scheduling on related machines without preemption2012-07-16Paper
Semi-online preemptive scheduling: one algorithm for all variants2012-04-24Paper
Semi-online preemptive scheduling: one algorithm for all variants2011-05-23Paper
Semi-online preemptive scheduling: study of special cases2010-08-17Paper
https://portal.mardi4nfdi.de/entity/Q35793722010-08-06Paper
Optimal and online preemptive scheduling on uniformly related machines2009-12-02Paper
Preemptive online scheduling: Optimal algorithms for all speeds2009-05-06Paper
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines2009-02-12Paper
Online Scheduling of Equal-Length Jobs on Parallel Machines2008-09-25Paper
Preemptive Online Scheduling: Optimal Algorithms for All Speeds2008-03-11Paper
STACS 20042007-10-01Paper
Approximation and Online Algorithms2007-02-12Paper

Research outcomes over time

This page was built for person: Tomáš Ebenlendr

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Person:537920&oldid=7603123"
Powered by MediaWiki