A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:21, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on deterministic online algorithms for scheduling on related machines without preemption |
scientific article |
Statements
A lower bound on deterministic online algorithms for scheduling on related machines without preemption (English)
0 references
12 May 2015
0 references
online algorithms
0 references
scheduling
0 references
makespan
0 references
uniformly related machines
0 references
lower bounds
0 references
