Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042)

From MaRDI portal
Revision as of 14:57, 29 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 2065409
Language Label Description Also known as
English
Measures of subproblem criticality in decomposition algorithms for shop scheduling
scientific article; zbMATH DE number 2065409

    Statements

    Measures of subproblem criticality in decomposition algorithms for shop scheduling (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2004
    0 references
    0 references