Mean Flow Time Minimization in Reentrant Job Shops with a Hub

DOI10.1287/opre.44.5.764zbMath0879.90116OpenAlexW2108967685MaRDI 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 boundshereditary ordertotal flow timeshortest path algorithmclustered schedulesreentrant job shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (11)

Practical solutions for a dock assignment problem with trailer transportation ⋮ Scheduling in reentrant robotic cells: algorithms and complexity ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems ⋮ Mixed binary integer programming formulations for the reentrant job shop scheduling problem ⋮ Re-entrant flowshop scheduling with learning considerations to minimize the makespan ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ Scheduling job families on non-identical parallel machines with time constraints ⋮ 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

This page was built for publication: Mean Flow Time Minimization in Reentrant Job Shops with a Hub