A hybrid backtracking search algorithm for permutation flow-shop scheduling problem

Abstract

The Permutation Flow-shop Scheduling Problem (PFSP) which is an NP-complete problem widely exists in many industrial manufacturing systems, such as motor industry, semiconductor industry, and appliance industry. Therefore, how to obtain the optimal schedule for PFSP is very important for these manufacturing systems. Many attentions from researchers and engineers have been paid to solve this problem, but the developments of more effective and efficient scheduling technologies and methods are never end. In this paper, based on a new evolutionary algorithm – Backtracking Search Algorithm (BSA), a hybrid BSA (HBSA) is proposed for PFSP with the objective to minimize the makespan. To make original BSA suitable for discrete problems, some improvements and relative techniques about original BSA, such as crossover and mutation strategies, simulated annealing (SA) mechanism used to avoid premature and random insertion local search, are presented. 29 famous benchmark problems have been used to evaluate the performance of the proposed HBSA. And several comparisons between HBSA and some other classical algorithms are conducted. The results show the effectiveness of proposed HBSA.