Mean Flow Time Minimization in Reentrant Job Shops with a Hub

DOI10.1287/opre.44.5.764zbMath0879.90116MaRDI QIDQ4345597

Sheldon X. C. Lou, Yingmeng Wang, Wiesław X. Kubiak

Publication date: 23 July 1997

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.44.5.764

zbMATH Keywords

worst-case bounds; hereditary order; total flow time; shortest path algorithm; clustered schedules; reentrant job shop

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C39: Dynamic programming

Related Items

Practical solutions for a dock assignment problem with trailer transportation, Minimizing total completion time for re-entrant flow shop scheduling problems, Scheduling job families on non-identical parallel machines with time constraints, Scheduling in reentrant robotic cells: algorithms and complexity, Minimizing total tardiness on a two-machine re-entrant flowshop, Decomposition methods for reentrant flow shops with sequence-dependent setup times, Non-bottleneck machines in three-machine flow shops, Re-entrant flowshop scheduling with learning considerations to minimize the makespan, Flow shops with reentry: reversibility properties and makespan optimal schedules, Mixed binary integer programming formulations for the reentrant job shop scheduling problem