On randomized online scheduling
From MaRDI portal
Publication:3579202
DOI10.1145/509907.509930zbMath1192.68091OpenAlexW1963663039MaRDI QIDQ3579202
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509930
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (22)
A survey on makespan minimization in semi-online environments ⋮ Scheduling with testing on multiple identical parallel machines ⋮ Online parallel machines scheduling with two hierarchies ⋮ A survey on combinatorial optimization in dynamic environments ⋮ Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures ⋮ Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing ⋮ Improved lower bounds for online scheduling to minimize total stretch ⋮ Multiprofessor scheduling ⋮ New upper and lower bounds for online scheduling with machine cost ⋮ Semi-online scheduling revisited ⋮ Online scheduling with reassignment ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Online algorithms with advice for bin packing and scheduling problems ⋮ Improved randomized online scheduling of intervals and jobs ⋮ On robust online scheduling algorithms ⋮ Randomized priority algorithms ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Pseudo lower bounds for online parallel machine scheduling ⋮ Extension of algorithm list scheduling for a semi-online scheduling problem ⋮ Preemptive online scheduling: Optimal algorithms for all speeds ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Efficient job scheduling algorithms with multi-type contentions
This page was built for publication: On randomized online scheduling
