The complexity of two supply chain scheduling problems (Q2444850)

From MaRDI portal
Revision as of 15:15, 7 July 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
The complexity of two supply chain scheduling problems
scientific article

    Statements

    title
    The complexity of two supply chain scheduling problems (English)
    0 references
    author
    Jianfeng Ren
    0 references
    Dong-lei Du
    0 references
    Da-Chuan Xu
    0 references
    publication date
    11 April 2014
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    68Q17
    0 references
    90C60
    0 references
    90B06
    0 references
    zbMATH DE Number
    6282900
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    manufacturing and scheduling
    0 references
    supply chains
    0 references
    NP-complete
    0 references
    OpenAlex ID
    W2081396989
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2444850&oldid=35383037"
    Powered by MediaWiki