Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization

DOI10.1016/j.ejor.2008.04.033zbMath1176.90523MaRDI QIDQ1041924

Yi Zhang, Qian Wang, Xiao-Ping Li

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.04.033

zbMATH Keywords

scheduling; genetic algorithm; permutation flowshop; total flowtime

Mathematics Subject Classification ID

90C27: Combinatorial optimization

Related Items

A poly-hybrid PSO optimization method with intelligent parameter adjustment, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Local search methods for the flowshop scheduling problem with flowtime minimization

Cites Work

• Unnamed Item
• A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
• Some efficient heuristic methods for the flow shop sequencing problem
• Minimizing total tardiness in permutation flowshops
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• A genetic algorithm for flowshop sequencing
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Benchmarks for basic scheduling problems
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• Optimal two- and three-stage production schedules with setup times included
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem
• The Complexity of Flowshop and Jobshop Scheduling
• A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem