Permutation Flow Shop Problem with Shortening Job Processing Times (Q2821099)

From MaRDI portal
Revision as of 10:04, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Permutation Flow Shop Problem with Shortening Job Processing Times
scientific article

    Statements

    title
    Permutation Flow Shop Problem with Shortening Job Processing Times (English)
    0 references
    author
    Zhenyou Wang
    0 references
    Cai-Min Wei
    0 references
    Yuan-Yuan Lu
    0 references
    publication date
    16 September 2016
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C59
    0 references
    90C57
    0 references
    zbMATH DE Number
    6628045
    0 references
    zbMATH Keywords
    scheduling
    0 references
    permutation flow shop
    0 references
    shortening job processing times
    0 references
    makespan
    0 references
    branch-and-bound algorithm
    0 references
    heuristic algorithm
    0 references
    cites work
    OpenAlex ID
    W2499725767
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2821099&oldid=37000337"
    Powered by MediaWiki