On-line scheduling of equal-length intervals on parallel machines

Authors:
Stanley P. Y. Fung;Chung Keung Poon;Duncan K. W. Yung
Affiliations:
University of Leicester, Leicester, UK;City University of Hong Kong, Hong Kong, China;City University of Hong Kong, Hong Kong, China
Venue:
Information Processing Letters
Year:
2012

Citing 9
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
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

SIAM Journal on Computing
Online computation and competitive analysis

Online computation and competitive analysis
Competitive non-preemptive call control

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
Interval scheduling on related machines

Computers and Operations Research

SIGACT news online algorithms column 21: APPROX and ALGO

ACM SIGACT News

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider the on-line preemptive scheduling of weighted equal-length intervals on multiple machines to maximize the total weight of completed intervals. We design an algorithm that is 2-competitive when the number of machines m is even; and (2+22m-1)-competitive when m is an odd number at least 3. For example, when m=3, it is 2.4-competitive. As m increases, the competitive ratio approaches 2.