Mean Flow Time Minimization in Reentrant Job Shops with a Hub (Q4345597): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/opre.44.5.764 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2108967685 / rank
 
Normal rank

Latest revision as of 21:52, 19 March 2024

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
    0 references