Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475939 | Computers & Operations Research | 2009 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Xingye Dong, Houkuan Huang, Ping Chen,