A lower bound for randomized on-line scheduling algorithms

Information Processing Letters

Volumn 51, Issue 5, 1994, Pages 219-222

  Chen, Bo ^a   van Vliet, André ^a   Woeginger, Gerhard J ^b  

^a Erasmus University Rotterdam   (Netherlands)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Combinatorial problems; On line algorithms; Randomization; Scheduling; Worst case bounds

Indexed keywords

ALGORITHMS; ONLINE SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBABILISTIC LOGICS; RANDOM PROCESSES; SCHEDULING;

COMBINATORIAL PROBLEMS; MACHINE SCHEDULING; ON LINE ALGORITHMS; RANDOMIZATION; WORST CASE RATIO;

DATA STRUCTURES;

EID: 0028495207     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(94)00110-3     Document Type: Article

References (4)

1. New algorithms for an ancient scheduling problem
2. On the power of randomization in on-line algorithms
3. An optimal algorithm for preemptive on-line scheduling
4. Bounds for Certain Multiprocessing Anomalies