Randomized on-line scheduling on three processors.

DOI10.1016/j.orl.2003.05.003zbMath1137.90524OpenAlexW2149452866MaRDI QIDQ1417594

Tomas Tichý

Publication date: 5 January 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.05.003

zbMATH Keywords

schedulingparallel machinescompetitive ratiorandomized algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Preemptive online scheduling: Optimal algorithms for all speeds

Cites Work

• A lower bound for randomized on-line multiprocessor scheduling
• New algorithms for an ancient scheduling problem.
• A lower bound for randomized on-line scheduling algorithms
• Online randomized multiprocessor scheduling
• An optimal algorithm for preemptive on-line scheduling

This page was built for publication: Randomized on-line scheduling on three processors.