A polynomial algorithm for some preemptive multiprocessor task scheduling problems (Q2432888)

From MaRDI portal
Revision as of 13:20, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for some preemptive multiprocessor task scheduling problems
scientific article

    Statements

    A polynomial algorithm for some preemptive multiprocessor task scheduling problems (English)
    0 references
    0 references
    0 references
    25 October 2006
    0 references
    0 references
    scheduling
    0 references
    complexity theory
    0 references
    multiprocessor tasks
    0 references
    dedicated processors
    0 references