Title :
Large-scale flow shop scheduling based on genetic algorithm
Author_Institution :
Sch. of Econ. & Manage., Zhejiang Univ. of Sci. & Technol., Hangzhou, China
Abstract :
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.
Keywords :
flow shop scheduling; genetic algorithms; computational complexity; evolutionary computation method; flow shop scheduling; genetic algorithm; modeling complexity; mutation operator; production scheduling problem; Computational complexity; Computational modeling; Dynamic scheduling; Genetic algorithms; Genetic mutations; Job shop scheduling; Large-scale systems; Mathematical model; Processor scheduling; Production; flow shop scheduling; genetic agorithm; simulation;
Conference_Titel :
Education Technology and Computer (ICETC), 2010 2nd International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-6367-1
DOI :
10.1109/ICETC.2010.5529244