Hardness of Precedence Constrained Scheduling on Identical Machines (Q3115866)

From MaRDI portal
Revision as of 01:51, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Hardness of Precedence Constrained Scheduling on Identical Machines
scientific article

    Statements

    title
    Hardness of Precedence Constrained Scheduling on Identical Machines (English)
    0 references
    DOI
    10.1137/100810502
    0 references
    author
    Ola Svensson
    0 references
    publication date
    11 February 2012
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68Q25
    0 references
    68M20
    0 references
    zbMATH DE Number
    6005547
    0 references
    zbMATH Keywords
    hardness of approximation
    0 references
    scheduling
    0 references
    OpenAlex ID
    W1995073517
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3115866&oldid=32674400"
    Powered by MediaWiki