The complexity of scheduling independent two-processor tasks on dedicated processors (Q1107984): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 03:13, 5 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
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    edge coloring
    0 references
    NP-completeness
    0 references
    two-processor task scheduling
    0 references