A lower bound for randomized on-line multiprocessor scheduling (Q287130)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound for randomized on-line multiprocessor scheduling |
scientific article |
Statements
A lower bound for randomized on-line multiprocessor scheduling (English)
0 references
26 May 2016
0 references
combinatorial problems
0 references
online algorithms
0 references
randomization
0 references
scheduling
0 references
worst-case bounds
0 references
0 references
