LAUSR

In this paper we propose the evolutionary clustering search (ECS) algorithm combined with a variable neighbourhood search (VNS) for the m-machine blocking flow shop scheduling problem with total tardiness minimization. The proposed ECS uses NEH-based procedure to generate an initial solution, the genetic algorithm to generate solutions and VNS to improve the solutions. A set of experiments were carried out to adjust the parameter of the metaheuristic. ECS is compared with ILS by Ribas et al. (J Prod Res 51(17):5238–5252, 2013), known as the best metaheuristic for the problem. Computational tests show superiority of the new method for the set of problems evaluated. Finally, we update 67 new best values of best-know found by ECS.