Heuristic algorithms for two machine re-entrant flow shop
From MaRDI portal
Publication:930923
DOI10.1016/j.tcs.2008.02.046zbMath1145.68006MaRDI QIDQ930923
Guochun Tang, Caixia Jing, Xingsan Qian
Publication date: 24 June 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.046
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- A heuristic algorithm for two-machine re-entrant shop scheduling
- Decomposition methods for reentrant flow shops with sequence-dependent setup times
- Batching and Scheduling in FMS Hubs: Flow Time Considerations
- 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