Abstract:

In order to solve the permutation flowshop problem to minimize makespan subjected to a given maximum tardiness upper bound effectively, we presented a new iterated greedy heuristic algorithm IG_CZ by combining global and local optimization to obtain optimal solution or nearoptimum solution. Finally, IG_CZ was tested on different scale benchmarks based on Taillard standard test sets. The result shows that IG_CZ is simple, implemented easily, and the solution quality and the ability to gain solution of IG_CZ precede other compared algorithms.

Key words: flowshop scheduling； iterated greedy； makespan； maximum tardiness