An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times

被引:56
|
作者
Keskinturk, Timur [2 ]
Yildirim, Mehmet B. [1 ]
Barut, Mehmet [3 ]
机构
[1] Wichita State Univ, Dept Ind & Mfg Engn, Wichita, KS 67260 USA
[2] Istanbul Univ, Fac Business Adm, Dept Quantitat Methods, TR-34320 Istanbul, Turkey
[3] Wichita State Univ, Dept Finance Real Estate & Decis Sci, Barton Sch Business, Wichita, KS 67260 USA
关键词
Load balancing; Parallel-machine scheduling; Sequence-dependent setups; Ant colony optimization; Genetic algorithm; Heuristics; GENETIC ALGORITHM; MINIMIZATION;
D O I
10.1016/j.cor.2010.12.003
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This study introduces the problem of minimizing average relative percentage of imbalance (ARPI) with sequence-dependent setup times in a parallel-machine environment. A mathematical model that minimizes ARPI is proposed. Some heuristics, and two metaheuristics, an ant colony optimization algorithm and a genetic algorithm are developed and tested on various random data. The proposed ant colony optimization method outperforms heuristics and genetic algorithm. On the other hand, heuristics using the cumulative processing time obtain better results than heuristics using setup avoidance and a hybrid rule in assignment. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1225 / 1235
页数:11
相关论文
共 50 条