A new algorithm for online uniform-machine scheduling to minimize the makespan (Q845691)
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 5664466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new algorithm for online uniform-machine scheduling to minimize the makespan |
scientific article; zbMATH DE number 5664466 |
Statements
A new algorithm for online uniform-machine scheduling to minimize the makespan (English)
0 references
29 January 2010
0 references
online algorithms
0 references
competitive ratio
0 references
multi-machine scheduling
0 references
uniform machines
0 references
0.8958070278167725
0 references
0.8958070278167725
0 references
0.8879228234291077
0 references
0.8823684453964233
0 references
0.8763492107391357
0 references
