Complexity of two dual criteria scheduling problems (Q2643797)

From MaRDI portal
Revision as of 14:19, 26 June 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
Complexity of two dual criteria scheduling problems
scientific article

    Statements

    title
    Complexity of two dual criteria scheduling problems (English)
    0 references
    author
    Yumei Huo
    0 references
    Joseph Y.-T. Leung
    0 references
    Hairong Zhao
    0 references
    publication date
    27 August 2007
    0 references
    zbMATH DE Number
    5183111
    0 references
    zbMATH Keywords
    NP-hard
    0 references
    dual criteria
    0 references
    single machine
    0 references
    OpenAlex ID
    W2033326904
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2643797&oldid=34986596"
    Powered by MediaWiki