On the competitiveness of on-line real-time task scheduling
Real-Time Systems
MOCA: a multiprocessor on-line competitive algorithm for real-time system scheduling
Theoretical Computer Science - Special issue on dependable parallel computing
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Bounding the Power of Preemption in Randomized Scheduling
SIAM Journal on Computing
A short proof that “proper = unit”
Discrete Mathematics - Special issue on partial ordered sets
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An Improved Randomized On-Line Algorithm for a Weighted Interval Selection Problem
Journal of Scheduling
Scheduling broadcasts with deadlines
Theoretical Computer Science - Special papers from: COCOON 2003
Laxity helps in broadcast scheduling
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Improved on-line broadcast scheduling with deadlines
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A near optimal scheduler for on-demand data broadcasts
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Randomized online interval scheduling
Operations Research Letters
Improved Randomized Results for That Interval Selection Problem
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
Hi-index | 0.00 |
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total weight of completed intervals. An optimal 4-competitive algorithm has long been known in the deterministic case, but the randomized case remains open. We give the first randomized algorithm for this problem, achieving a competitive ratio of 3.618. We also prove a randomized lower bound of 4/3, which is an improvement over the previous 5/4 result, and a lower bound of 2 for a class of barely random algorithms which include our new algorithm. We also show that the techniques can be carried to the deterministic multiprocessor case, giving a 3.618-competitive 2-processor algorithm, a 5/4 lower bound for any number of processors, and a 2 lower bound for 2 processors.