Barely random algorithms for multiprocessor scheduling

DOI10.1023/A:1022960526107MaRDI QIDQ2464396zbMATH OpenOpenAlexFDO

Authors S. S. Seiden

Publication date 20 December 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022960526107

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 1305421
• Online randomized multiprocessor scheduling
• A lower bound for randomized on-line scheduling algorithms
• Randomized on-line scheduling on two uniform machines
• Randomized algorithms for that ancient scheduling problem

Cited in

(3)

• New Scheduling Strategies for Randomized Incremental Algorithms in the Context of Speculative Parallelization
• scientific article; zbMATH DE number 1894930 (Why is no real title available?)
• Randomized algorithms for fully online multiprocessor scheduling with testing

This page was built for publication: Barely random algorithms for multiprocessor scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464396)