A lower bound for randomized on-line scheduling algorithms

• 12 September 1994
• journal article
• Published by Elsevier in Information Processing Letters
• Vol. 51  (5) , 219-222
• https://doi.org/10.1016/0020-0190(94)00110-3

Abstract

Keywords

• COMBINATORIAL PROBLEMS
• ON-LINE ALGORITHMS
• WORST CASE BOUNDS
• SCHEDULING
• RANDOMIZATION