Genetic Algorithm Combined with Gradient Information for Flexible Job-shop Scheduling Problem with Different Varieties and Small Batches

• Published in: MATEC web of conferences Vol. 95; p. 10001
• Main Authors: Chen, Ming, Li, Jie-Lin
• Format: Journal Article Conference Proceeding
• Language: English
• Published: Les Ulis EDP Sciences 01.01.2017
• Subjects: Computer simulation; Fragmentation; Genes; Genetic algorithms; Heuristic methods; Job shops; Mutation; Production scheduling; Scheduling
• ISSN: 2261-236X; 2274-7214; 2261-236X
• DOI: 10.1051/matecconf/20179510001

To solve the Flexible Job-shop Scheduling Problem (FJSP) with different varieties and small batches, a modified meta-heuristic algorithm based on Genetic Algorithm (GA) is proposed in which gene encoding is divided into process encoding and machine encoding, and according to the encoding mode, the machine gene fragment is connected with the process gene fragment and can be changed with the alteration of process genes. In order to get the global optimal solutions, the crossover and mutation operation of the process gene fragment and machine gene fragment are carried out respectively. In the initialization operation, the machines with shorter manufacturing time are more likely to be chosen to accelerate the convergence speed and then the tournament selection strategy is applied due to the minimum optimization objective. Meanwhile, a judgment condition of the crossover point quantity is introduced to speed up the population evolution and as an important interaction bridge between the current machine and alternative machines in the incidence matrix, a novel mutation operation of machine genes is proposed to achieve the replacement of manufacturing machines. The benchmark test shows the correctness of proposed algorithm and the case simulation proves the proposed algorithm has better performance compared with existing algorithms.