An Improved Genetic Algorithm for Flexible Job Shop Scheduling Problem

Based on the analysis of the characteristics of Flexible Job-shop Scheduling Problem (FJSP), an improved genetic algorithm is proposed to minimize the make span. The algorithm adopts a new initialization method to improve the quality of the initial population and to accelerate the speed of the algorithm's convergence. Considering the characteristic of the problem, reasonable chromosome encoding, crossover and mutation operator are given, and then the effectiveness of the improved algorithm is proved by testing.