Minimizing total completion time for re-entrant flow shop scheduling problems

DOI10.1016/J.TCS.2011.08.030MaRDI QIDQ650903zbMATH OpenOpenAlexFDO

Authors Caixia Jing, Wanzhen Huang, Guochun Tang

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

zbMATH Keywords

lower boundheuristic algorithmtotal completion timere-entrant flow shop scheduling

Mathematics Subject Classification ID

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

Recommendations

• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Minimizing makespan on a two-machine re-entrant flowshop
• 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

Cites work

• A heuristic algorithm for two-machine re-entrant shop scheduling
• Heuristic algorithms for two machine re-entrant flow shop
• 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
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Multi-family scheduling in a two-machine reentrant flow shop with setups
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(14)

• scientific article; zbMATH DE number 6719013 (Why is no real title available?)
• Minimizing Mean Completion Time for Special Flowshop Problems
• Makespan minimization in reentrant flow shop problem with identical jobs
• Mean Flow Time Minimization in Reentrant Job Shops with a Hub
• Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem
• Scheduling reentrant jobs on parallel machines with a remote server
• Minimizing makespan in re-entrant permutation flow-shops
• Reentrant hybrid flowshop scheduling problem based on total weighted completion time
• New efficient algorithms for the two-machine no-wait chain-reentrant shop problem
• Flow shops with reentry: the total weighted completion time objective
• Minimizing total tardiness on a two-machine re-entrant flowshop
• Minimizing total completion time for flowshop scheduling problem with uncertain processing times
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Single machine scheduling with re-entrance

This page was built for publication: Minimizing total completion time for re-entrant flow shop scheduling problems

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