An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

作者：Dong Xingye^*; Huang Houkuan; Chen Ping

来源：Computers & Operations Research, 2009, 36(5): 1664-1669.

DOI：10.1016/j.cor.2008.04.001

• Scheduling
• Iterated local search
• Metaheuristic
• Permutation flowshop
• Total flowtime

An ILS algorithm is proposed to solve the permutation flowshop sequencing problem with total flowtime criterion. The effects of different initial permutations and different perturbation strengths are studied. Comparisons are carried out with three constructive heuristics, three ant-colony algorithms and a particle swarm optimization algorithm. Experiments on benchmarks and a set of random instances show that the proposed algorithm is more effective. The presented ILS improves the best known permutations by a significant margin.

• 出版日期2009-5
• 单位北京交通大学