Hybrid flow-shop scheduling problems with multiprocessor task systems. (Q1410328)

From MaRDI portal
Revision as of 11:44, 6 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
Hybrid flow-shop scheduling problems with multiprocessor task systems.
scientific article

    Statements

    title
    Hybrid flow-shop scheduling problems with multiprocessor task systems. (English)
    0 references
    author
    Yakov Zinder
    0 references
    Van Ha Do
    0 references
    Adam Janiak
    0 references
    Maciej Lichtenstein
    0 references
    Oguz, Ceyda
    0 references
    publication date
    14 October 2003
    0 references
    Mathematics Subject Classification ID
    90B35
    0 references
    90C39
    0 references
    90B40
    0 references
    65Y20
    0 references
    zbMATH DE Number
    1992616
    0 references
    zbMATH Keywords
    Complexity theory
    0 references
    Dynamic programming
    0 references
    Scheduling
    0 references
    Tabu search
    0 references
    cites work
    Q4339078
    0 references
    Q4396949
    0 references
    Q4198056
    0 references
    Tabu Search—Part I
    0 references
    Tabu Search—Part II
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1410328&oldid=34351062"
    Powered by MediaWiki