A Dual-Population Genetic Algorithm with Q-Learning for Multi-Objective Distributed Hybrid Flow Shop Scheduling Problem
Jidong Zhang, Jingcao Cai
Abstract
In real-world production processes, the same enterprise often has multiple factories or one factory has multiple production lines, and multiple objectives need to be considered in the production process. A dual-population genetic algorithm with Q-learning is proposed to minimize the maximum completion time and the number of tardy jobs for distributed hybrid flow shop scheduling problems, which have some symmetries in machines. Multiple crossover and mutation operators are proposed, and only one search strategy combination, including one crossover operator and one mutation operator, is selected in each iteration. A population assessment method is provided to evaluate the evolutionary state of the population at the initial state and after each iteration. Two populations adopt different search strategies, in which the best search strategy is selected for the first population and the search strategy of the second population is selected under the guidance of Q-learning. Experimental results show that the dual-population genetic algorithm with Q-learning is competitive for solving multi-objective distributed hybrid flow shop scheduling problems.