Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (Q4671351)

From MaRDI portal
Revision as of 16:37, 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 2161436
Language Label Description Also known as
English
Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems
scientific article; zbMATH DE number 2161436

    Statements

    Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2005
    0 references
    0 references