Complexity of flowshop scheduling problems with a new blocking constraint (Q2572855)

From MaRDI portal
Revision as of 08:07, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Complexity of flowshop scheduling problems with a new blocking constraint
scientific article

    Statements

    title
    Complexity of flowshop scheduling problems with a new blocking constraint (English)
    0 references
    author
    Yanyan Li
    0 references
    publication date
    4 November 2005
    0 references
    zbMATH DE Number
    2223370
    0 references
    zbMATH Keywords
    Scheduling
    0 references
    Flowshop
    0 references
    Blocking
    0 references
    Complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2572855&oldid=15330294"
    Powered by MediaWiki