Hybrid discrete bat algorithm for solving the multi-objective flexible job shop scheduling problem

被引：4

作者：

Xu H. ^{[1
]}

Zhang T. ^{[1
]}

机构：

[1] School of Internet of Things Engineering, Jiangnan University, Wuxi

来源：

Jixie Gongcheng Xuebao/Journal of Mechanical Engineering | 2016年 / 52卷 / 18期

关键词：

Clock algorithm; Discrete bat algorithm; Flexible job-shop scheduling; Optimization algorithm; The priority assignment rules;

D O I：

10.3901/JME.2016.18.201

中图分类号：

学科分类号：

摘要：

Aiming at the flexible job shop scheduling problem with the goal of the maximum completion time, production cost and production quality, a hybrid discrete bat algorithm is proposed based on studying and analyzing the bat algorithm. In order to improve the quality of initial population of the hybrid discrete bat algorithm for solving the multi-objective flexible job shop scheduling problem, a priority assignment rule is proposed to produce initial population which improves the global searching ability of the algorithm based on the analysis of both initial machine selection and scheduling completion time of each process. At the same time, use position mutation strategy to search the optimal location as much as possible in a relatively short time, which can avoid the premature convergence effectively. The clock algorithm is proposed for the first time in the target value of the calculation problem. Commence from the concrete examples, the experimental results show that the algorithm has good performance in solving the flexible job shop scheduling problem, and it is an effective scheduling algorithm, which provides a new way to solve this kind of problems. © 2016 Journal of Mechanical Engineering.

引用

页码：201 / 212

页数：11

共 34 条

[11]

Peng J., Liu M., Zhang M., Et al., Cloud model evolutionary multi-objective flexible job-shop scheduling based on improved non-dominated sorting, Journal of Mechanical Engineering, 50, 12, pp. 198-205, (2014)

[12]

Luan F., Wang W., Fu W., Et al., FJSP solving by improved GA based on PST hierarchy structure, Computer Integrated Manufacturing Systems, 20, 10, pp. 2494-2501, (2014)

[13]

Zhao S., Bilevle neighborhood search hybrid algorithm for the flexible job shop scheduling problem, Journal of Mechanical Engineering, 51, 14, pp. 175-184, (2015)

[14]

Zhao S., Fang S., Gu X., Genetic algorithm with new initialization mechanism for flexible job shop scheduling, Journal of Zhejiang University, 47, 6, pp. 1022-1030, (2013)

[15]

Zhao S., Fang S., Gu X., Machine selection and FJSP solution based on limit scheduling completion time minimization, Computer Integrated Manufacturing Systems, 20, 4, pp. 854-865, (2014)

[16]

Cui J., Li T., Zhang W., Hybrid flowshop scheduling model and its genetic algorithm, Journal of University of Science and Technology Beijing, 27, 5, pp. 623-626, (2005)

[17]

Imen D., Kinza N.M., Assia L., A new genetic algorithm for flexible job-shop scheduling problems, Journal of Mechanical Science and Technology, 29, 3, pp. 1273-1281, (2015)

[18]

Zhang Q., Chen Y., Hybrid PSO-NEH algorithm for solving no-wait flexible flow shop scheduling problem, Systems Engineering - Theory & Practice, 34, 3, pp. 802-809, (2014)

[19]

Manas R.S., Mahapatra S.S., Kaushik M., A novel swarm optimiser for flexible flow shop scheduling, International Journal of Swarm Intelligence, 1, 1, pp. 51-69, (2013)

[20]

Yao C., Wang B., Chen D., Et al., Hybrid-particle interaction particle swarm optimization algorithm, Journal of Mechanical Engineering, 51, 6, pp. 178-184, (2015)

← 1 2 3 4 →