Shuffled Frog Leaping Algorithm for a Bi-objective No-Idle Permutation Flow Shop

In this paper, the bi-criteria no-idle permutation flow shop scheduling problem (NIPFS) with make span and mean tardiness minimization is considered. A pareto-based shuffled frog leaping algorithm (PSFL) is proposed. A shuffled frog leaping algorithm(SFLA) oriented updating mechanism is developed for the discrete combinatorial optimization. An insert-neighborhood-based local search is incorporated into PSFL to speed up the finding of optimal solutions. The proposal is compared with NSGAII, adapted to the considered problem, on modified Tail lard benchmarks with the same computation time. Experimental results show that the proposal outperforms NSGAII in effectiveness on average but it is outperformed by NSGAII on large size instances. The abstract goes here.