Minimizing mean flow time with release time constraint (Q914352)
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: Publication:914352 |
scientific article; zbMATH DE number 4149526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing mean flow time with release time constraint |
scientific article; zbMATH DE number 4149526 |
Statements
Minimizing mean flow time with release time constraint (English)
0 references
1990
0 references
independent taks on m\(\geq 1\) identical processors
0 references
preemptive scheduling
0 references
NP-hard
0 references
0.928536593914032
0 references
0.9283709526062012
0 references
0.89646315574646
0 references
0.8650621771812439
0 references
