Preemptive Online Scheduling: Optimal Algorithms for All Speeds

DOI10.1007/11841036_31zbMath1131.90356OpenAlexW2104263758MaRDI QIDQ5449539

Wojciech Jawor, Jiří Sgall, Tomáš Ebenlendr

Publication date: 11 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11841036_31

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Randomized algorithms (68W20)

Related Items (4)

A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ Preemptive scheduling on a small number of hierarchical machines ⋮ Optimal on-line algorithms to minimize makespan on two machines with resource augmentation ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information

This page was built for publication: Preemptive Online Scheduling: Optimal Algorithms for All Speeds