Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (Q1278299)

From MaRDI portal
Revision as of 17:31, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
scientific article

    Statements

    Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors (English)
    0 references
    0 references
    22 April 1999
    0 references
    biprocessor task
    0 references
    edge coloring
    0 references
    makespan
    0 references
    NP-completeness
    0 references
    polynomial algorithm
    0 references
    precedence constraints
    0 references
    total completion time
    0 references

    Identifiers