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

From MaRDI portal
Revision as of 14:14, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q62048705, #quickstatements; #temporary_batch_1711094041063)
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
    0 references
    0 references