Hybrid artificial bee colony algorithms for flowshop scheduling problem with limited buffers

被引：0

作者：

机构：

[1] School of Computer Science, Liaocheng University

来源：

Zhang, P.-W. (zpw_6699@163.com) | 2013年 / CIMS卷 / 19期

关键词：

Artificial bee colony algorithm; Flow shop scheduling problem; Genetic algorithms; Hybrid algorithms; Limited buffers; Neighborhood search algorithm;

D O I：

10.13196/j.cims.2013.10.ZHANGPeiwen.20131016

中图分类号：

学科分类号：

摘要：

Aiming at the limited buffer flow shop scheduling problem with maximum makespan as objective, an effective Hybrid Artificial Bee Colony (HABC) algorithm was proposed. The population was initialized by WPFE heuristic algorithm to improve the quality of initial population. The genetic algorithm was introduced into the employed bee stage of artificial bee colony to design six hybrid scheduling algorithms based on embedded structure, collaborative structure, serial structure, concurrent structure, probability selection structure and bi-group structure. To enhance the algorithm's exploitation ability, an effective local search method based on insert and swap neighborhood was embedded in HABC. The computation results demonstrated the effectiveness and superiority of the proposed HABC.

引用

页码：2510 / 2520

页数：10

共 19 条

[1]

Thornton H.W., Hunsucker J.L., A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage, European Journal of Operational Research, 152, 1, pp. 96-114, (2004)

[2]

Duclos L.K., Spencer M.S., The impact of a constraint buffer in a flow shop, International Journal of Production Economics, 42, 2, pp. 175-185, (1995)

[3]

Smutnick C., A two-machine permutation flow shop scheduling problem with buffers, OR Spectrum, 20, 4, pp. 229-235, (1998)

[4]

Nowicki E., The permutation flow shop with buffers: A tabu search approach, European Journal of Operational Research, 116, 1, pp. 205-219, (1999)

[5]

Brucker P., Heitmann S., Hurink J., Flow-shops with intermediate buffers, OR Spectrum, 25, 4, pp. 549-574, (2003)

[6]

Wang L., Zhang L., Genetic algorithm with multiple searching modes for flow-shop scheduling with limited buffers, Computer Integrated Manufacturing Systems, 11, 7, pp. 1041-1046, (2005)

[7]

Liu B., Wang L., Jin Y., An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, Computers and Operation Research, 35, 9, pp. 2791-2806, (2008)

[8]

Pan Q., Wang L., Gao L., An effective hybrid discrete differential evolution algorithm for the flow shop scheduling with intermediate buffers, Information Sciences, 181, 3, pp. 668-685, (2011)

[9]

Karaboga D., An idea based on honey bee swarm for numerical optimization, (2005)

[10]

Pan Q., Zhu J., The effective hybrid procedures based on evolutionary algorit hms and simulated annealing algorithms for Job Shop scheduling problems, Chinese Journal of Mechanical Engineering, 41, 6, pp. 224-227, (2005)

← 1 2 →