Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (Q4658386)

From MaRDI portal
Revision as of 12:38, 2 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2146665
Language Label Description Also known as
English
Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability
scientific article; zbMATH DE number 2146665

    Statements

    Complexity results and approximation algorithms for the two machine no-wait flow-shop with limited machine availability (English)
    0 references
    0 references
    0 references
    0 references
    16 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    flow shop
    0 references
    complexity
    0 references
    heuristics
    0 references