Minimizing maximum (weighted) flow-time on related and unrelated machines (Q513278)
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: Minimizing maximum (weighted) flow-time on related and unrelated machines |
scientific article; zbMATH DE number 6691863
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing maximum (weighted) flow-time on related and unrelated machines |
scientific article; zbMATH DE number 6691863 |
Statements
Minimizing maximum (weighted) flow-time on related and unrelated machines (English)
0 references
3 March 2017
0 references
scheduling
0 references
minimizing flow-time
0 references
online algorithms
0 references
competitive analysis
0 references
0.99999976
0 references
0.9658916
0 references
0.9658916
0 references
0.9383855
0 references
0.92355007
0 references
0.91441333
0 references
0.9113941
0 references
0.9064911
0 references
