Robust Algorithms for Preemptive Scheduling

DOI10.1007/978-3-642-23719-5_48zbMath1307.68090OpenAlexW2172490232MaRDI QIDQ3092261

Asaf Levin, Leah Epstein

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_48

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Simultaneously load balancing for every p-norm, with reassignments ⋮ The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Online load balancing on uniform machines with limited migration

This page was built for publication: Robust Algorithms for Preemptive Scheduling