Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm

The blocking flowshop scheduling problem has a strong industrial background but is under-represented in the research literature. In this study, a revised artificial immune system (RAIS) algorithm based on the features of artificial immune systems and the annealing process of simulated annealing algorithms was presented to minimize the makespan in a blocking flowshop. To validate the performance of the proposed RAIS algorithm, computational experiments and comparisons were conducted on the well-known benchmark problems of Taillard used in earlier studies. The experimental results show that the proposed RAIS algorithm outperforms the state-of-art algorithms on the same benchmark problem data set.

► An AIS algorithm is presented to minimize the makespan in a blocking flowshop. ► The proposed AIS algorithm outperforms the state-of-art algorithms. ► A lot of new best solutions for Taillard's instances are reported.