Bounding the Power of Preemption in Randomized Scheduling
From MaRDI portal
Publication:4210081
DOI10.1137/S0097539795283292zbMath0907.68007OpenAlexW1975122098MaRDI QIDQ4210081
Publication date: 20 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795283292
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (20)
Scheduling maintenance jobs in networks ⋮ Online interval scheduling on a single machine with finite lookahead ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Online selection of intervals and \(t\)-intervals ⋮ Online scheduling of bounded length jobs to maximize throughput ⋮ On-line scheduling of equal-length intervals on parallel machines ⋮ Online interval scheduling with a bounded number of failures ⋮ Improved Randomized Results for That Interval Selection Problem ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. ⋮ Competitive algorithms for multistage online scheduling ⋮ Improved randomized online scheduling of intervals and jobs ⋮ Interval scheduling on related machines ⋮ Improved randomized results for the interval selection problem ⋮ Improved Randomized Online Scheduling of Unit Length Intervals and Jobs ⋮ Multistage interval scheduling games ⋮ Online interval scheduling to maximize total satisfaction ⋮ A general framework for handling commitment in online throughput maximization ⋮ Online interval scheduling: Randomized and multiprocessor cases ⋮ Online scheduling of jobs with fixed start times on related machines
Uses Software
This page was built for publication: Bounding the Power of Preemption in Randomized Scheduling
