The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of scheduling independent two-processor tasks on dedicated processors |
scientific article; zbMATH DE number 4066309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of scheduling independent two-processor tasks on dedicated processors |
scientific article; zbMATH DE number 4066309 |
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
