Minimizing average flow-time under knapsack constraint (Q896150)
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 average flow-time under knapsack constraint |
scientific article; zbMATH DE number 6520539
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing average flow-time under knapsack constraint |
scientific article; zbMATH DE number 6520539 |
Statements
Minimizing average flow-time under knapsack constraint (English)
0 references
11 December 2015
0 references
approximation algorithms
0 references
multiprocessor scheduling
0 references
average flow-time
0 references
0.9999436736106871
0 references
0.7920677661895752
0 references
0.7788559198379517
0 references
0.768588125705719
0 references
0.7646395564079285
0 references
