Scheduling Flat Graphs (Q3741045)
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 3976324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling Flat Graphs |
scientific article; zbMATH DE number 3976324 |
Statements
Scheduling Flat Graphs (English)
0 references
1985
0 references
scheduling a partially ordered set of unit length tasks
0 references
identical processors
0 references
structure of the precedence graph
0 references
intrees
0 references
outtrees
0 references
optimal schedule
0 references
0.8832671046257019
0 references
0.8624357581138611
0 references
0.8215523362159729
0 references
0.8178284168243408
0 references
