Ordinal On-Line Scheduling on Two Uniform Machines

Authors:
Zhiyi Tan;Yong He
Affiliations:
-;-
Venue:
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Year:
2000

Citing 7
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Semi on-line scheduling on two identical machines

Computing
Randomized online scheduling on two uniform machines

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On-Line Bin-Stretching

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Semi on-line algorithms for the partition problem

Operations Research Letters
Ordinal algorithms for parallel machine scheduling

Operations Research Letters
Bin packing using semi-ordinal data

Operations Research Letters

Quantified Score

Hi-index	0.07

Visualization

Abstract

We investigate the ordinal on-line scheduling problem on two uniform machines. We present a comprehensive lower bound of any ordinal algorithm, which constitutes a piecewise function of machine speed ratio s ≥ 1. We further propose an algorithm whose competitive ratio matches the lower bound for most of s ∈ (1, ∞). The total length of the intervals of s where the competitive ratio does not match the lower bound is less than 0.7784 and the biggest gap never exceeds 0.0521.