Mean Flow Time Minimization in Reentrant Job Shops with a Hub (Q4345597)

From MaRDI portal
Revision as of 11:08, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1038873
Language Label Description Also known as
English
Mean Flow Time Minimization in Reentrant Job Shops with a Hub
scientific article; zbMATH DE number 1038873

    Statements

    Mean Flow Time Minimization in Reentrant Job Shops with a Hub (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 July 1997
    0 references
    0 references
    worst-case bounds
    0 references
    reentrant job shop
    0 references
    total flow time
    0 references
    hereditary order
    0 references
    shortest path algorithm
    0 references
    clustered schedules
    0 references