Optimal preemptive semi-online scheduling on two uniform processors

Authors:
Donglei Du
Affiliations:
Faculty of Administration, University of New Brunswick, P.O. Box 4400, Fredericton, NB, E3B 5V4, Canada
Venue:
Information Processing Letters
Year:
2004

Citing 8
Cited 0

Semi on-line scheduling on two identical machines

Computing
Preemptive Scheduling of Uniform Processor Systems

Journal of the ACM (JACM)
Optimal Non-preemptive Semi-online Scheduling on Two Related Machines

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Semi on-line algorithms for the partition problem

Operations Research Letters
Ordinal algorithms for parallel machine scheduling

Operations Research Letters
Preemptive on-line scheduling for two uniform processors

Operations Research Letters
Semi-online scheduling with decreasing job sizes

Operations Research Letters
Optimal preemptive semi-online scheduling to minimize makespan on two related machines

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We investigate a preemptive semi-online scheduling problem. Jobs with sizes within a certain range [1, r] (r≥1 ) arrive one by one to be scheduled on two uniform parallel processors with speed 1 and s≥1, respectively. The objective is to minimize makespan. We characterize the optimal competitive ratio as a function of both s and r by devising a deterministic on-line scheduling algorithm along with a matching lower bound, which also holds for randomized algorithms.