Improved competitive algorithms for online scheduling with partial job values (Q1884846)
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: Improved competitive algorithms for online scheduling with partial job values |
scientific article; zbMATH DE number 2110953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved competitive algorithms for online scheduling with partial job values |
scientific article; zbMATH DE number 2110953 |
Statements
Improved competitive algorithms for online scheduling with partial job values (English)
0 references
27 October 2004
0 references
Online algorithms
0 references
Scheduling
0 references
Partial job values
0 references
Resource augmentation
0 references
0 references
1.0000001
0 references
0.9001587
0 references
0.8929913
0 references
0 references
0.8886996
0 references
0.88812417
0 references
0.8861746
0 references
0 references
0.88476235
0 references
0.88389313
0 references
