Limited Buffer Flow Workshop Scheduling Based on Improved Dandelion Optimization Algorithm
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [20]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    To solve the flow shop scheduling problem with limited buffers and machine processing gears (FSSP_LBMPG), this research establishes a mathematical programming model for green flow shops with limited buffers. The model has two objective functions: the minimized values of maximum completion time and processing energy consumption. With buffer capacity as a constraint, the processing speed and energy consumption are coordinated by reasonably selecting machine processing gears. Based on the characteristics of the problem model, an improved dandelion optimization algorithm (IDOA) is proposed. The algorithm first designs a DOA double-layer real-valued encoding mechanism to represent the solution to the problem according to the characteristics of the scheduling problem. By introducing an initialization mechanism, the quality and efficiency of the initial solution are improved. During algorithm iteration, a real-valued crossover strategy and a variable neighborhood search strategy are designed to compensate for the poor local search ability of the original dandelion algorithm and enhance the development capabilities of the improved algorithm. Comparative experiments on designed cases show that the proposed improved algorithm effectively enhances the performance of the original algorithm, thereby verifying the effectiveness and robustness of the improved algorithm.

    Reference
    [1] Qin M, Wang RS, Shi ZS, et al. A genetic programming-based scheduling approach for hybrid flow shop with a batch processor and waiting time constraint. IEEE Transactions on Automation Science and Engineering, 2021, 18(1): 94–105.
    [2] Meng T, Pan QK, Wang L. A distributed permutation flowshop scheduling problem with the customer order constraint. Knowledge-based Systems, 2019, 184: 104894.
    [3] Qin HX, Han YY, Wang YT, et al. Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowledge-based Systems, 2022, 258: 109962.
    [4] 轩华, 郑倩倩, 李冰. 带不相关并行机的阻塞FFP的混合遗传算法. 计算机工程与设计, 2021, 42(4): 949–956.
    [5] 温廷新, 关婷誉. 考虑能耗和运输的有限缓冲区混合流水车间调度. 系统仿真学报, 2024, 36(6): 1344–1358.
    [6] Han X, Han YY, Zhang B, et al. An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion. Applied Soft Computing, 2022, 129: 109502.
    [7] Aqil S, Allali K. Two efficient nature inspired meta-heuristics solving blocking hybrid flow shop manufacturing problem. Engineering Applications of Artificial Intelligence, 2021, 100: 104196.
    [8] Liang J, Wang P, Guo L, et al. Multi-objective flow shop scheduling with limited buffers using hybrid self-adaptive differential evolution. Memetic Computing, 2019, 11(4): 407–422.
    [9] Bai DY, Liu TY, Zhang YC, et al. Scheduling non-permutation flowshop with finite buffers and two competitive agents. Computers & Industrial Engineering, 2023, 177: 108939.
    [10] Kazemi Esfeh M, Shojaie AA, Javanshir H, et al. Flexible flow shop scheduling problem with reliable transporters and intermediate limited buffers via considering learning effects and budget constraint. Complexity, 2022, 2022: 1253336.
    [11] Janeš G, Ištoković D, Jurković Z, et al. Application of modified steady-state genetic algorithm for batch sizing and scheduling problem with limited buffers. Applied Sciences, 2022, 12(22): 11512.
    [12] 徐震浩, 王程, 顾幸生. 基于DICA的存储受限流水车间调度. 华东理工大学学报(自然科学版), 2018, 44(4): 563–572.
    [13] Lu C, Huang YX, Meng LL, et al. A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers. Robotics and Computer-integrated Manufacturing, 2022, 74: 102277.
    [14] Jiang SL, Zhang L. Energy-oriented scheduling for hybrid flow shop with limited buffers through efficient multi-objective optimization. IEEE Access, 2019, 7: 34477–34487.
    [15] Yaurima-Basaldua VH, Tchernykh A, Villalobos-Rodríguez F, et al. Hybrid flow shop with unrelated machines, setup time, and work in progress buffers for bi-objective optimization of tortilla manufacturing. Algorithms, 2018, 11(5): 68.
    [16] Han ZH, Han C, Lin S, et al. Flexible flow shop scheduling method with public buffer. Processes, 2019, 7(10): 681.
    [17] Zhao SJ, Zhang TR, Ma SL, et al. Dandelion optimizer: A nature-inspired metaheuristic algorithm for engineering applications. Engineering Applications of Artificial Intelligence, 2022, 114: 105075.
    [18] 胡蓉, 董钰明, 钱斌. 基于探路者算法的绿色有限缓冲区流水线调度. 系统仿真学报, 2021, 33(6): 1384–1396.
    [19] Lei DM, Zheng YL, Guo XP. A shuffled frog-leaping algorithm for flexible job shop scheduling with the consideration of energy consumption. International Journal of Production Research, 2017, 55(11): 3126–3140.
    [20] 秦浩翔, 韩玉艳, 陈庆达, 等. 求解阻塞混合流水车间调度的双层变异迭代贪婪算法. 控制与决策, 2022, 37(9): 2323–2332.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

李伟铭,杨敬辉.改进蒲公英优化算法的有限缓冲区流水车间调度.计算机系统应用,2024,33(8):240-249

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 21,2024
  • Revised:March 19,2024
  • Online: July 03,2024
Article QR Code
You are the first990587Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063