A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6435514
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on deterministic online algorithms for scheduling on related machines without preemption |
scientific article; zbMATH DE number 6435514 |
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
0.9506250619888306
0 references
0.909180462360382
0 references
0.8665010929107666
0 references
0.8665010929107666
0 references
