Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (Q4380542)

From MaRDI portal
Revision as of 20:13, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1129407
Language Label Description Also known as
English
Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity
scientific article; zbMATH DE number 1129407

    Statements

    title
    Minimizing Makespan In Flowshops With Pallet Requirements: Computational Complexity (English)
    0 references
    author
    Michael Y. Wang
    0 references
    Q170700
    0 references
    Steef L. van de Velde
    0 references
    publication date
    7 September 1998
    0 references
    zbMATH DE Number
    1129407
    0 references
    zbMATH Keywords
    flowshop scheduling
    0 references
    makespan
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4380542&oldid=8845156"
      Powered by MediaWiki