Dual population algorithm for distributed permutation flow shop with variable processing speed
Affiliation:

Hubei University of Technology

Fund Project:

National key research and development program(2018YFC0116100);Key Project of Science and Technology Research Program of Hubei Educational Committee (D20211402);Key Research and Development Project of Hubei Province(2020BAB114、2023BAB094);

  • Article
  • | |
  • Metrics
  • |
  • Reference [17]
  • | |
  • Cited by
  • | |
  • Comments
    Abstract:

    Aiming at the distributed permutation flow shop scheduling problem with variable processing speed, a double population algorithm is proposed to optimize the maximum completion time and the total energy consumption of the machine. Firstly, an initialization method that mixes four strategies is used to generate a high-quality initial population. Secondly, specific evolution methods are designed according to the characteristics of the two pop-ulations, and the dynamic guide factor is introduced to adjust the evolution mode of the population. At the same time, an energy-saving strategy for speed regulation is proposed to further optimize energy consumption. Finally, a dynamic population strategy is proposed to balance the resources of the two populations. The effectiveness of each strategy is proved by simulation experiments, and compared with other algorithms, the results show that the proposed algorithm has obvious advantages.

    Reference
    [1] M. R. Garey, D. S. Johnson, and R. Sethi. The complexity of flowshop and jobshop scheduling. Math. Oper. Res., vol. 1, no. 2, pp. 117–129,May 1976.
    [2] 轩华,李文婷,李冰.混合离散人工蜂群算法求解含不相关并行机的分布式柔性流水线调度[J].控制与决策,2023,38(03):779-789.u Hua, Li Wenting, Li Bing. Hybrid discrete artificial bee colony algorithm for distributed flexible flowline scheduling with unrelated parallel machines[J]. Control and Decision, 2023,38(03):779-789.
    [3] 王思涵,李新宇,高亮等.分布式车间调度研究综述[J].华中科技大学学报(自然科学版),2022,50.Wang Sihan, Li Xinyu, Gao Liang et al. A review of distributed shop scheduling problems[J]. J. Huazhong Univ. of Sci. Tech. (Natural Science Edition) ,2022,50(06).
    [4] B. Naderi, R. Ruiz, The distributed permutation flowshop scheduling problem,Comput. Oper. Res. 37 (2010) 754–768.
    [5] Li, J.-q., Bai, S.-C., Duan, P.-y., Sang, H.-y., Han, Y.-y., Zheng, Z.-x. (2019a). An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. International Journal of Production Research, 57 (22), 6922–6942.
    [6] Zhao F, Shao D, Wang L, Xu T, Zhu N (2022) Jonrinaldi, An effective water wave optimization algorithm with problemspecific knowledge for the distributed assembly blocking flow-shop scheduling problem. Knowl-Based Syst 243:108471.
    [7] Jiang J, An Y, Dong Y, et al. Integrated optimization of non-permutation flow shop scheduling and maintenance planning with variable processing speed[J]. Reliability Engineering System Safety, 2023, 234: 109143.
    [8] Huang K, Li R, Gong W, et al. BRCE: bi-roles co-evolution for energy-efficient distributed heterogeneous permutation flow shop scheduling with flexible machine speed[J]. Complex Intelligent Systems, 2023: 1-12.
    [9] Wang JJ, Wang L (2020) A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop.IEEE Trans Syst Man Cybern Syst 50(5):1805–1819.
    [10] Wang G, Gao L, Li X, et al. Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm[J]. Swarm and Evolutionary Computation, 2020, 57: 100716.
    [11] 罗聪,龚文引.混合分解多目标进化算法求解绿色置换流水车间调度问题[J/OL].控制与决策:1-9[2023-08-02].uo Cong, Gong Wenyin. A hybrid multi-objective evolutionary algorithm based on decomposition for green permutation flow shop-scheduling problem.Control and Decision, 1-9[2023-08-02].
    [12] Fathollahi-Fard A M, Woodward L, Akhrif O. Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept[J]. Journal of Industrial Information Integration, 2021, 24: 100233.
    [13] 吴秀丽,闫晓燕.基于改进Q学习的可重入混合流水车间绿色动态调度.机械工程学报:1-14[2023-08-04].WU Xiuli YAN Xiaoyan. An Improved Q Learning Algorithm to Optimize Green Dynamic Scheduling Problem in a Reentrant Hybrid Flow Shop[J]. JOURNAL OF MECHANICAL ENGINEERING:1-14[2023-08-04].
    [14] 徐明,张剑铭,陈松航等.柔性作业车间调度问题的多目标优化算法[J].计算机与现代化,2021(12):1-6.u Ming, Zhang Jianming, Chen Songhang et al. Multi-objective Optimization Algorithm for Flexible Job Shop Scheduling Problem[J]. Computer and Modernization,2021(12):1-6.
    [15] Quanke P, Gao L, Xinyu L, et al. Effective constructive heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem.Applied Soft Computing, 2019, 81: 105492.
    [16] 丁美芳,吴克晴,肖鹏.多策略融合的黄金正弦樽海鞘群算法[J/OL].南京信息工程大学学报(自然科学版):1-13[2023-09-05].DING Meifang, WU Keqing, XIAO Peng. Golden sine salp swarm algorithm with multi-strategy[J/OL]. Journal of Nanjing University of Information Science Technology(Natural Science Edition) :1-13[2023-09-05].
    [17] 王秋莲,段星皓.基于高维多目标候鸟优化算法的柔性作业车间调度[J].中国机械工程,2022,33(21):2601-2612.ang Qiulian, Duan Xinghao. Scheduling of flexible job shop based on high-dimensional multi-objective migratory bird optimization algorithm[J]. China Mechanical Engineering,2022,33(21):2601-2612.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation
Share
Article Metrics
  • Abstract:282
  • PDF: 0
  • HTML: 0
  • Cited by: 0
History
  • Received:September 05,2023
  • Revised:October 09,2023
  • Adopted:October 11,2023
Article QR Code

Address:No. 219, Ningliu Road, Nanjing, Jiangsu Province

Postcode:210044

Phone:025-58731025