On-line scheduling to minimize average completion time revisited. (Q703266)
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: On-line scheduling to minimize average completion time revisited. |
scientific article; zbMATH DE number 2125910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On-line scheduling to minimize average completion time revisited. |
scientific article; zbMATH DE number 2125910 |
Statements
On-line scheduling to minimize average completion time revisited. (English)
0 references
11 January 2005
0 references
Scheduling
0 references
On-line algorithm
0 references
Approximation algorithm
0 references
Competitive analysis
0 references
0 references
0 references
0 references
0.9663876295089722
0 references
0.8919333219528198
0 references
0.8899680376052856
0 references
0.8645315170288086
0 references
