Heuristic algorithms for two machine re-entrant flow shop

DOI10.1016/J.TCS.2008.02.046MaRDI QIDQ930923zbMATH OpenOpenAlexFDO

Authors Caixia Jing, Guochun Tang, 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

zbMATH Keywords

schedulingheuristic algorithmmakespanre-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)

Recommendations

• A heuristic algorithm for two-machine re-entrant shop scheduling
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
• A heuristic method for two-stage hybrid flow shop with dedicated machines
• Heuristics for two-machine flowshop scheduling with setup times and an availability constraint
• Heuristic algorithms for continuous flow-shop problem
• Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
• Minimizing makespan on a two-machine re-entrant flowshop
• A heuristic search algorithm for flow-shop scheduling
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• A heuristic algorithm for two-machine re-entrant shop scheduling
• Batching and Scheduling in FMS Hubs: Flow Time Considerations
• Decomposition methods for reentrant flow shops with sequence-dependent setup times
• 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

Cited in

(12)

• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment
• Minimizing total tardiness on a two-machine re-entrant flowshop
• A New Bottleneck-Based Heuristic for Reentrant Job Shops: A Case Study in a Textile Factory
• Scheduling reentrant jobs on parallel machines with a remote server
• Re-entrant flowshop scheduling with learning considerations to minimize the makespan
• Minimizing total completion time for re-entrant flow shop scheduling problems
• Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
• Minimizing makespan in re-entrant permutation flow-shops
• An iterated local search for a re-entrant flow shop scheduling problem
• Minimizing makespan on an \(m\)-machine re-entrant flowshop

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

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