Mean Flow Time Minimization in Reentrant Job Shops with a Hub

DOI10.1287/OPRE.44.5.764MaRDI QIDQ4345597zbMATH OpenOpenAlexFDO

Authors Sheldon X. C. Lou, Yingmeng Wang, Wieslaw 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

clustered scheduleshereditary orderreentrant job shopshortest path algorithmtotal flow timeworst-case bounds

Mathematics Subject Classification ID

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

Recommendations

• Minimizing total completion time for re-entrant flow shop scheduling problems
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Minimizing Makespan in a Class of Reentrant Shops
• Minimizing makespan in re-entrant permutation flow-shops
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing Mean Completion Time for Special Flowshop Problems
• Reoptimization of the minimum total flow-time scheduling problem
• Efficient methods to schedule re-entrant flowshop system

Cited in

(15)

• 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
• Practical solutions for a dock assignment problem with trailer transportation
• Minimizing Makespan in a Class of Reentrant Shops
• Efficient algorithms for flexible job shop scheduling with parallel machines
• Minimizing total completion time for re-entrant flow shop scheduling problems
• Makespan minimization in reentrant flow shop problem with identical jobs
• Flow shops with reentry: the total weighted completion time objective
• Scheduling job families on non-identical parallel machines with time constraints
• Scheduling in reentrant robotic cells: algorithms and complexity
• On the connection between a cyclic job shop and a reentrant flow shop scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4345597)