《2016 An effective genetic algorithm for the flexible job-shop scheduling problem》.pdf

Expert Systems with Applications 38 (2011) 3563–3573 Contents lists available at ScienceDirect Expert Systems with Applications journal homepag e: /locate/eswa An effective genetic algorithm for the flexible job-shop scheduling problem Guohui Zhang a, Liang Gao b,⇑, Yang Shi b a Zhengzhou Institute of Aeronautical Industry Management, Middle Daxue Road, Zhengzhou 450015, China b The State Key Laboratory of Digital Manufacturing Equipment and Technology, 1037 Luoyu Road, Huazhong University of Science and Technology, Wuhan 430074, China a r t i c l e i n f o a b s t r a c t Keywords: In this paper, we proposed an effective genetic algorithm for solving the flexible job-shop scheduling Genetic algorithm problem (FJSP) to minimize makespan time. In the proposed algorithm, Global Selection (GS) and Local Flexible job-shop scheduling Selection (LS) are designed to generate high-quality initial population in the initialization stage. An Chromosome representation improved chromosome representation is used to conveniently represent a solution of the FJSP, and dif- Initialization ferent strategies for crossover and mutation operator are adopted. Various benchmark data taken from literature are tested. Computational results prove the proposed genetic algorithm effective and efficient for solving flexible job-shop scheduling problem.