Ant colony optimization technique for the sequence-dependent flowshop scheduling problem

作者：Mirabi Mohammad^*

来源：International Journal of Advanced Manufacturing Technology, 2011, 55(1-4): 317-326.

DOI：10.1007/s00170-010-3037-0

• Ant colony optimization
• Scheduling
• Permutation flowshop
• Sequence-dependent
• Makespan

In the real world, production scheduling systems, usually optimal job scheduling, requires an explicit consideration of sequence-dependent setup times. One of the most important scheduling criteria in practical systems is makespan. In this paper, the author presents an ant colony optimization (ACO) algorithm for the sequence-dependent permutation flowshop scheduling problem. The proposed ACO algorithm benefits from a new approach for computing the initial pheromone values and a local search. The proposed algorithm is tested on randomly generated problem instances and results indicate that it is very competitive with the existing best metaheuristics.

• 出版日期2011-7