The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984): Difference between revisions
From MaRDI portal
Latest revision as of 18:46, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of scheduling independent two-processor tasks on dedicated processors |
scientific article |
Statements
The complexity of scheduling independent two-processor tasks on dedicated processors (English)
0 references
1987
0 references
computational complexity
0 references
edge coloring
0 references
NP-completeness
0 references
two-processor task scheduling
0 references