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 条

[1]

Zhu X., Li X., Wang Q., Total-idle-time increment based hybrid GA for no-wait flowshops with makespan minimization, Journal of Computer Research and Development, 48, 3, pp. 455-463, (2011)

[2]

Garey E.L., Johnson D.S., Sethi R., The complexity of flowshop and job-shop scheduling, Mathematics of Operations, 1, pp. 117-129, (1976)

[3]

Rock H., The three-machine no-wait flow shop problem is NP-complete, Association for Computing Machinery, 31, 2, pp. 336-345, (1984)

[4]

Xi W.J., Wu Z.M., An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers and Industrial Engineering, 48, 2, pp. 409-425, (2005)

[5]

Na H.B., Park J., Multi-level job scheduling in a flexible job shop environment, International Journal of Production Research, 52, 13, pp. 3877-3887, (2013)

[6]

Alper T., Serol B., A hybrid algorithm for total tardiness minimization in flexible job shop: Genetic algorithm with parallel VNS execution, International Journal of Production Research, 53, 6, pp. 1832-1848, (2015)

[7]

Yuan Y., Xu H., Multiobjective flexible job shop scheduling using memetic algorithms, IEEE Transactions on Automation Science & Engineering, 12, 1, pp. 336-353, (2015)

[8]

Miguel A., Camino R.V., Ramiro V., Scatter search with path relinking for the flexible job shop scheduling problem, European Journal of Operational Research, 245, 1, pp. 35-45, (2015)

[9]

Liu A., Yang Y., Xing Q., Et al., Multi-population genetic algorithm in multiobjective fuzzy and flexible job shop scheduling, Computer Integrated Manufacturing Systems, 17, 9, pp. 1954-1961, (2011)

[10]

Zhang C., Dong X., Wang X., Et al., Improved NSGA-II for the multi-objective flexible job-shop scheduling problem, Journal of Mechanical Engineering, 46, 11, pp. 156-164, (2010)

← 1 2 3 4 →