A novel Discrete Differential Evolution (DDE) algorithm is proposed in this paper for solving no-idle permutation flow-shop scheduling problems with maximum completion time (makespan) criterion. Firstly, individuals of the DDE algorithm are represented as discrete job permutations, and new...

The blocking flowshop scheduling problem with makespan criterion has important applications in a variety of industrial systems. Heuristics that explore specific characteristics of the problem are essential for many practical systems to find good solutions with limited computational effort. This...