The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90176-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063957224 / rank | |||
Normal rank | |||
Revision as of 00:21, 20 March 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
