Minimizing total completion time for re-entrant flow shop scheduling problems
From MaRDI portal
Publication:650903
DOI10.1016/j.tcs.2011.08.030zbMath1228.90035OpenAlexW2005705791MaRDI QIDQ650903
Caixia Jing, Guochun Tang, Wanzhen Huang
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.030
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Heuristic algorithms for two machine re-entrant flow shop
- Minimizing total tardiness on a two-machine re-entrant flowshop
- A heuristic algorithm for two-machine re-entrant shop scheduling
- Minimizing makespan on an \(m\)-machine re-entrant flowshop
- Multi-family scheduling in a two-machine reentrant flow shop with setups
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Minimizing Makespan in a Class of Reentrant Shops
- Minimizing makespan in re-entrant permutation flow-shops
- Minimizing makespan on a two-machine re-entrant flowshop
This page was built for publication: Minimizing total completion time for re-entrant flow shop scheduling problems