Scheduling chains to minimize mean flow time (Q290213)
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: Scheduling chains to minimize mean flow time |
scientific article; zbMATH DE number 6588292
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling chains to minimize mean flow time |
scientific article; zbMATH DE number 6588292 |
Statements
Scheduling chains to minimize mean flow time (English)
0 references
1 June 2016
0 references
analysis of algorithms
0 references
combinatorial problems
0 references
computational complexity
0 references
0.9468178
0 references
0.9089022
0 references
0.90425855
0 references
0.9033192
0 references
0.89162207
0 references
0.8877903
0 references
0 references
0 references
0.8791776
0 references
0.87802184
0 references
