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

From MaRDI portal
Revision as of 22:25, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A polynomial algorithm for some preemptive multiprocessor task scheduling problems
scientific article

    Statements

    title
    A polynomial algorithm for some preemptive multiprocessor task scheduling problems (English)
    0 references
    author
    Łukasz Kuszner
    0 references
    Michał Małafiejski
    0 references
    publication date
    25 October 2006
    0 references
    zbMATH DE Number
    5067646
    0 references
    zbMATH Keywords
    scheduling
    0 references
    complexity theory
    0 references
    multiprocessor tasks
    0 references
    dedicated processors
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2432888&oldid=15087948"
    Powered by MediaWiki