Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help
From MaRDI portal
Publication:5432368
DOI10.1137/S0097539704446608zbMath1154.68567MaRDI 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)
68W40: Analysis of algorithms
68W10: Parallel algorithms in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
90B99: Operations research and management science
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items
Unnamed Item, Temperature aware online algorithms for scheduling equal length jobs, A comprehensive study of an online packet scheduling algorithm, Online production planning to maximize the number of on-time orders, A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts, Dispersing points on intervals, Improved randomized online scheduling of intervals and jobs, Online scheduling of jobs with kind release times and deadlines on a single machine, Online scheduling of bounded length jobs to maximize throughput, Temperature Aware Online Algorithms for Scheduling Equal Length Jobs, Improved Online Scheduling in Maximizing Throughput of Equal Length 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
