Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900)
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 5843508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines |
scientific article; zbMATH DE number 5843508 |
Statements
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (English)
0 references
1 February 2011
0 references
randomized multilevel feedback algorithm
0 references
parallel machines
0 references
0.96920055
0 references
0.9274564
0 references
0.89922094
0 references
0.8962196
0 references
0.88821137
0 references
0.88821113
0 references
0 references
0.87990177
0 references
