A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208)
From MaRDI portal
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
0 references
