Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
From MaRDI portal
Publication:5432368
DOI10.1137/S0097539704446608zbMath1154.68567OpenAlexW2047204419MaRDI QIDQ5432368
Tomas Tichý, Wojciech Jawor, Jiří Sgall, Marek Chrobak
Publication date: 3 January 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539704446608
Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Operations research and management science (90B99) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (15)
Online production planning to maximize the number of on-time orders ⋮ Temperature aware online algorithms for scheduling equal length jobs ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ Online scheduling of jobs with kind release times and deadlines on a single machine ⋮ Unnamed Item ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ Dispersing points on intervals ⋮ Temperature Aware Online Algorithms for Scheduling Equal Length Jobs ⋮ Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs ⋮ A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts ⋮ Improved randomized online scheduling of intervals and jobs ⋮ A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers ⋮ Online algorithms for the maximum \(k\)-interval coverage problem
This page was built for publication: Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
