Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines |
scientific article; zbMATH DE number 5080010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines |
scientific article; zbMATH DE number 5080010 |
Statements
Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (English)
0 references
13 December 2006
0 references
semi-online
0 references
preemptive scheduling
0 references
uniform machines
0 references
competitive ratio
0 references
0 references
0 references
0 references
0.9494679
0 references
0.9440186
0 references
0.9407126
0 references
0.9343262
0 references
0.9323446
0 references
0.9263162
0 references
0.92359996
0 references
0.92250776
0 references
