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

From MaRDI portal
Revision as of 10:31, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Minimizing <i>L</i> <sub>max</sub> for large-scale, job-shop scheduling problems (English)
    0 references
    author
    Simon R. Schultz
    0 references
    Thom J. Hodgson
    0 references
    Russell E. King
    0 references
    Kristin A. Thoney
    0 references
    publication date
    26 April 2005
    0 references
    zbMATH DE Number
    2161436
    0 references
    OpenAlex ID
    W2112862921
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4671351&oldid=34394522"
    Powered by MediaWiki