Scheduling precedence graphs of bounded height (Q3339283)
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 3872672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling precedence graphs of bounded height |
scientific article; zbMATH DE number 3872672 |
Statements
Scheduling precedence graphs of bounded height (English)
0 references
1984
0 references
scheduling
0 references
partially ordered set of unit length tasks
0 references
identical processors
0 references
precedence graph
0 references
NP-completeness
0 references
polynomial algorithm
0 references
0.8832671046257019
0 references
0.8467559218406677
0 references
0.8454123139381409
0 references
0.8372533917427063
0 references
