A Modified NSGAⅡ Algorithm for SolvingComplex Hybrid Flow-Shop Scheduling Problem
A complex hybrid flow-shop scheduling problem is proposed in studying the sand cast shop scheduling problem with the existence of single-machine processes,parallel processes and batch processes in the same time.And a modified non-dominated sorting genetic algorithm is proposed to solve the problem.Firstly,a linear programming model was used with the objective of minimizing makespan and total energy cost simultaneously,and a heuristic deco-ding scheme based on stage characteristic was presented.Secondly,a crossover-matching mechanism based on non-dominating was adopted to increase solution diversity,and a greedy variable neighborhood search based on center of areas was used in the proposed algorithm to avoid poor results.Finally,numerical simulations show the effectiveness of the proposed algorithm.
NETL
NSTL
万方数据
