A Novel Production Scheduling Approach Based on Improved Hybrid Genetic Algorithm

摘要: Due to the complexity of the production shop in discrete manufacturing industry, traditional genetic algorithm (GA) cannot solve the production scheduling problem well. In order to enhance the GA-based method to solve the production scheduling problem, the simulated annealing algorithm (SAA) is used to develop an improved hybrid genetic algorithm. Firstly, the crossover probability and mutation probability of the genetic operation are adjusted, and the elite replacement operation is adopted for simulated annealing operator. Then, a mutation method is used for the comparison and replacement of the genetic operations to obtain the optimal value of the current state. Lastly, the proposed hybrid genetic algorithm is compared with several scheduling algorithms, and the superiority and efficiency of the proposed method are verified in solving the production scheduling.