Preemptive scheduling on uniform machines to minimize mean flow time (Q1017456)
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 5554742
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preemptive scheduling on uniform machines to minimize mean flow time |
scientific article; zbMATH DE number 5554742 |
Statements
Preemptive scheduling on uniform machines to minimize mean flow time (English)
0 references
19 May 2009
0 references
parallel uniform machines
0 references
linear programming
0 references
maximum flow
0 references
polynomial algorithm
0 references
0.8848526477813721
0 references
0.872440755367279
0 references
0.8721039891242981
0 references
