A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (Q2294894)
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 7166362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time |
scientific article; zbMATH DE number 7166362 |
Statements
A complexity analysis of parallel scheduling unit-time jobs with in-tree precedence constraints while minimizing the mean flow time (English)
0 references
12 February 2020
0 references
parallel scheduling
0 references
in-tree
0 references
precedence constraints
0 references
complexity theory
0 references
0 references
0 references
0 references
0.8544603586196899
0 references
0.8422151803970337
0 references
0.8323280215263367
0 references
0.8098433017730713
0 references
