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

From MaRDI portal
Revision as of 18:53, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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