A Hybrid Evolutionary Algorithm Using Two Solution Representations for Hybrid Flow-Shop Scheduling Problem.

As an extension of the classical flow-shop scheduling problem, the hybrid flow-shop scheduling problem (HFSP) widely exists in large-scale industrial production systems and has been considered to be challenging for its complexity and flexibility. Evolutionary algorithms based on encoding and heuristic decoding approaches are shown effective in solving the HFSP. However, frequently used encoding and decoding strategies can only search a limited area of the solution space, thus leading to unsatisfactory performance during the later period. In this article, a hybrid evolutionary algorithm (HEA) using two solution representations is proposed to solve the HFSP for makespan minimization. First, the proposed HEA searches the solution space by a permutation-based encoding representation and two heuristic decoding methods to find some promising areas. Afterward, a Tabu search (TS) procedure based on a disjunctive graph representation is introduced to expand the searching space for further optimization. Two classical neighborhood structures focusing on critical paths are extended to the problem-specific backward schedules to generate candidate solutions for the TS. The proposed HEA is tested on three public HFSP benchmark sets from the existing literature, including 567 instances in total, and is compared with some state-of-the-art algorithms. Extensive experimental results indicate that the proposed HEA performs much better than the other algorithms. Moreover, the proposed method finds new best solutions for 285 hard instances.