Heuristic algorithms for two machine re-entrant flow shop

DOI10.1016/j.tcs.2008.02.046zbMath1145.68006OpenAlexW1977288447MaRDI QIDQ930923

Xingsan Qian, Caixia Jing, Guochun Tang

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

zbMATH Keywords

schedulingmakespanheuristic algorithmre-entrant flow shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems

Cites Work

• 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
• Unnamed Item

This page was built for publication: Heuristic algorithms for two machine re-entrant flow shop