Abstrakt
We consider online preemptive scheduling of jobs with fixed starting times revealed at those times on uniformly related machines, with the goal of maximizing the total weight of completed jobs. Every job has a size and a weight associated with it.
A newly released job must be either assigned to start running immediately on a machine or otherwise it is dropped. It is also possible to drop an already scheduled job, but only completed jobs contribute their weights to the profit of the algorithm.
In the most general setting, no algorithm has bounded competitive ratio, and we consider a number of standard variants. We give a full classification of the variants into cases which admit constant competitive ratio (weighted and unweighted unit jobs, and C-benevolent instances, which is a wide class of instances containing proportional-weight jobs), and cases which admit only a linear competitive ratio (unweighted jobs and D-benevolent instances).
In particular, we give a lower bound of on the competitive ratio for scheduling unit weight jobs with varying sizes, which is tight. For unit size and weight we show that a natural greedy algorithm is -competitive and optimal on machines, while for large , its competitive ratio is between and.
Furthermore, no algorithm is better than -competitive.