首页 | 本学科首页   官方微博 | 高级检索  
     


An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
Authors:Timur KeskinturkMehmet B Yildirim  Mehmet Barut
Affiliation:a Department of Quantitative Methods, Faculty of Business Administration, Istanbul University, Istanbul 34320, Turkey
b Department of Industrial and Manufacturing Engineering, Wichita State University, Wichita, KS 67260, USA
c Department of Finance, Real Estate, and Decision Sciences, Barton School of Business, Wichita State University, Wichita, KS 67260, USA
Abstract: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.
Keywords:Load balancing  Parallel-machine scheduling  Sequence-dependent setups  Ant colony optimization  Genetic algorithm  Heuristics
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号