Complexity of Scheduling Parallel Task Systems (Q3832306)
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 4108470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of Scheduling Parallel Task Systems |
scientific article; zbMATH DE number 4108470 |
Statements
Complexity of Scheduling Parallel Task Systems (English)
0 references
1989
0 references
parallel algorithms
0 references
Parallel Task System
0 references
schedule length
0 references
nonpreemptive scheduling
0 references
strongly NP-hard
0 references
pseudo-polynomial time
0 references
0.8713277578353882
0 references
0.8713277578353882
0 references
0.8583487868309021
0 references
0.8564285039901733
0 references
0.8498773574829102
0 references
