Large-scale Flow Shop Scheduling Based On Genetic Algorithm
The flow shop scheduling problem has the property of modeling complexity, computational complexity, dynamic multi-constraint and multi-targeted. In recent years, a variety of evolutionary computation methods and the application of genetic algorithms have been gradually introduced into the production scheduling problem. In the paper, we design a new production scheduler program by using Matlab system and the method based on the genetic algorithm. Moreover, we use the actual production data to simulate the new scheduler. From the relevant simulation results we have verified that the differences existed in the optimal solution which from the combination of different crossover operators and mutation operator, and further obtained the better combination of crossover operator and mutation operator. Simulation results of our experiment show the feasibility and effectiveness of genetic algorithm for solving large-scale flow-shop scheduling.
genetic agorithm flow shop scheduling simulation
Songyan Zhang
School of Economics and Management Zhejiang University of Science and Technology Hangzhou 310023, P.R.China
国际会议
上海
英文
308-310
2010-06-22（万方平台首次上网日期，不代表论文的发表时间）