Amortized efficiency of list update and paging rules
Communications of the ACM
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
On-line scheduling of jobs with fixed start and end times
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Note on scheduling intervals on-line
Discrete Applied Mathematics
Bounding the power of preemption in randomized scheduling
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
Approximation and Online Algorithms
Improved randomized results for the interval selection problem
Theoretical Computer Science
Online splitting interval scheduling on m identical machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Interval scheduling on related machines
Computers and Operations Research
Online interval scheduling on a single machine with finite lookahead
Computers and Operations Research
Online interval scheduling: randomized and multiprocessor cases
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
Online interval scheduling problems arise in important application areas such as continuous media and call control. Woeginger gives an optimal 4-competitive deterministic algorithm for online interval scheduling. He leaves as an open problem whether randomization can be used to achieve a competitive ratio less than 4. A randomized (2+3