Improved artificial bee colony algorithm for distributed and flexible job-shop scheduling problem

被引：0
|
作者：
Wu R. [1 ]
Guo S.-S. [1 ]
Li Y.-B. [1 ]
Wang L. [1 ]
Xu W.-X. [1 ]
机构：
[1] School of Mechanical and Electrical Engineering, Wuhan University of Technology, Wuhan
来源：
Kongzhi yu Juece/Control and Decision | 2019年 / 34卷 / 12期
关键词：
Artificial bee colony algorithm; Critical path; Distributed and flexible job-shop scheduling; Job sequencing; Makespan; Manufacturing unit allocation;
D O I：
10.13195/j.kzyjc.2018.0336
中图分类号：
学科分类号：
摘要：
This paper analyzes the characteristics of the distributed and flexible job-shop scheduling problem and proposes an improved artificial bee colony algorithm for solving the problem. Firstly, a scheduling model is established to minimize the makespan. Then, some improvements are applied to the basic artificial bee colony algorithm so that it can solve this problem effectively, including a three-dimension encoding scheme, effective population initialization method based on the characteristics of the distributed and flexible job-shop scheduling problem, many evolutionary operators are designed for the employed bee search phase, and what's more, in onlooker bee phase, a local search operator based on the critical path is introduced to improve the local search capability of the algorithm. Finally, an experiment is designed to verify the performance of the algorithm based on the test data expanded from common benchmark of the flexible job-shop scheduling problem, and orthogonal test is used to optimize the parameters in the proposed algorithm. The results show that the improved artificial bee colony algorithm can effectively solve the problem. © 2019, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码：2527 / 2536
页数：9
相关论文
共 34 条
  • [1] Wu X.L., Zhang Z.Q., Du Y.H., Improved bacteria foraging optimization algorithm for flexible job shop, Computer Integrated Manufacturing Systems, 21, 5, pp. 1262-1270, (2015)
  • [2] Xu Y., Wang L., Wang S.Y., An effective teaching–learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time, Neurocomputing, 148, pp. 260-268, (2015)
  • [3] Wu X., Sun Y., A green scheduling algorithm for flexible job shop with energy-saving measures, J of Cleaner Production, 172, pp. 3249-3264, (2018)
  • [4] Lei D., Li M., Wang L., A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold, IEEE Trans on Cybernetics, 99, pp. 1-13, (2018)
  • [5] Lei D., Zheng Y., Guo X., A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption, Int J of Production Research, 55, 11, pp. 3126-3140, (2017)
  • [6] Wang L., Deng J., Wang S.J., Survey on optimization algorithms for distributed shop scheduling, Control and Decision, 31, 1, pp. 1-11, (2016)
  • [7] Chan F.T.S., Chung S.H., Chan P.L.Y., An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Systems with Applications, 29, 2, pp. 364-371, (2005)
  • [8] Chan F.T.S., Chung S.H., Chan P.L.Y., Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems, Int J of Production Research, 44, 3, pp. 523-543, (2006)
  • [9] Giovanni L.D., Pezzella F., An improved genetic algorithm for the distributed and flexible job-shop scheduling problem, European J of Operational Research, 200, 2, pp. 395-408, (2010)
  • [10] Huang Y.J., Yao X.F., Planning and scheduling of multiple flexible-shops based on analytical target cascading and particle swarm optimization, J of Central South University: Science and Technology, 43, 1, pp. 151-158, (2012)
1234