A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2896382)
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 6056152
| 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 6056152 |
Statements
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (English)
0 references
16 July 2012
0 references
0.9506250619888306
0 references
0.8986942768096924
0 references
0.8718189597129822
0 references
0.8718189597129822
0 references
