Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization

查看全文 作　　者：SANG [1,2]Hongyan;GAO [1]Liang;PAN [1,3]Quanke

机构地区：[1]State Key Lab. of Digital Manufacturing Equipment & Technology, Huazhong University of Science and Technology, Wuhan 430074, China;[2]School of Mathematics Science, Liaocheng University, Liaocheng 252059, China;[3]School of Computer Science, Liaocheng University, Liaocheng 252059, China

出　　处：《Chinese Journal of Mechanical Engineering》索引2012年第25卷第5期,共11页

基　　金：supported by National Natural Science Foundation of China (Grant Nos. 60973085, 61174187);National Hi-tech Research and Development Program of China (863 Program, Grant No. 2009AA044601);New Century Excellent Talents in University of China (Grant No. NCET-08-0232) 摘　　要：Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony (DABC) algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop. 关键词：离散粒子群优化算法总完工时间群算法工厂工蜂流水作业问题最小化地块

相关文献

参考文献（33）
引证文献（8）
耦合文献（5）

参考文献(33)

引证文献(8)

耦合文献(5)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization

参考文献(33)

引证文献(8)

耦合文献(5)

用户提示