An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups

作者：Liao Ching Jong^*; Juan Hsiao Chien

来源：Computers & Operations Research, 2007, 34(7): 1899-1909.

DOI：10.1016/j.cor.2005.07.020

• scheduling
• ant colony optimization
• weighted tardiness
• sequence-dependent setups

In many real-world production systems, it requires an explicit consideration of sequence-dependent setup times when scheduling jobs. As for the scheduling criterion, the weighted tardiness is always regarded as one of the most important criteria in practical systems. While the importance of the weighted tardiness problem with sequence-dependent setup times has been recognized, the problem has received little attention in the scheduling literature. In this paper, we present an ant colony optimization (ACO) algorithm for such a problem in a single-machine environment. The proposed ACO algorithm has several features, including introducing a new parameter for the initial pheromone trail and adjusting the timing of applying local search, among others. The proposed algorithm is experimented on the benchmark problem instances and shows its advantage over existing algorithms. As a further investigation, the algorithm is applied to the unweighted version of the problem. Experimental results show that it is very competitive with the existing best-performing algorithms.

• 出版日期2007-7