Differential evolution algorithm with variable neighborhood search for hybrid flow shop scheduling problem
Hybrid flow shop scheduling problem (HFSP) is a complex combinatorial optimization problem in real world applications. Due to the complexity and importance, the HFSP has been studied intensively. This paper presents differential evolution algorithm with variable neighborhood (DEVNS) search to solve HFSP. Experiments have been conducted and comparison has been made with the state-of-the-art algorithms. Experimental results show that the DEVNS algorithm is highly competitive in solving the HFSP.