Research on Flexible workshop Scheduling Based on harmony search Algorithm
DOI:
https://doi.org/10.54691/ds2w4m92Keywords:
Workshop scheduling problem; Harmony search algorithm; Flexible job shop scheduling; Minimize maximum completion time.Abstract
The purpose of this paper is to use the harmony search algorithm to solve the scheduling problem of flexible job shop, with the goal of minimizing the maximum completion time. The issue of flexible workshop scheduling is an important research content in the field of production operation management. It involves how to rationally arrange the processing sequence of different jobs on different machines to optimize production efficiency. As a heuristic optimization algorithm, the harmony search algorithm performs well in solving complex optimization problems with its good global search ability and robustness. This paper first establishes a mathematical model of the scheduling problem of flexible job shop, and expounds in detail the basic principle and process of the harmonic search algorithm. Subsequently, we designed a scheduling strategy based on the harmony search algorithm, and by adjusting the algorithm parameters and strategies, we realized the effective optimization of the maximum completion time. The experimental results show that the algorithm can significantly reduce the maximum completion time and improve production efficiency when solving the scheduling problem of flexible work workshops. The research in this paper not only provides a new solution method for the scheduling problem of flexible job shop, but also provides a useful reference for the application of harmonic search algorithm in similar problems.
Downloads
References
Deng Hai. Research on the dilemmas and solutions of multi-variety and small-batch production enterprises [D], 2017.
Zhang Xiaotong. Optimization of G company’s flexible welding workshop scheduling problem based on improved genetic algorithm [D], 2023.
Chen Jiwen, Zhang Yiyun, Gao Xiaoming. PC component production scheduling optimization based on improved genetic algorithm [J]. Mechanical Design and Manufacturing Engineering, 2024, 53(01): 95-9.
Zhu Hong. Research on the production scheduling problem of S company's brush workshop based on critical chain technology and push-pull combination strategy [D], 2023.
Ma Chang. Flexible job shop dynamic scheduling method for smart factories [D], 2023.
Feng Zhuoya. Formulation and selection of flexible job shop rescheduling plan considering multiple disturbances [D], 2023.
Shen Ruqing. Research on workshop layout optimization of Company A based on improved harmony search algorithm [D], 2023.
Yang Jia, Ji Zeyu, Wang Jiahao. Multipath QoS routing algorithm for distribution network WSNs based on improved harmony search [J]. Journal of Electrical Engineering: 1-8.
Liu Guanquan, Shen Ruqing, Pan Dandan. Workshop layout optimization based on improved harmony search algorithm [J]. Journal of Wuhan University of Technology (Information and Management Engineering Edition), 2023, 45(05): 704-10.
Li Hexiang. Research and implementation of target tracking system based on harmony search optimization algorithm [J]. Modern Computer, 2023, 29(19): 88-92.
Yang Hua, Liu Tianqi, Yu Jing. Harmony search algorithm and its application based on cell-type membrane computing framework [J]. Journal of Hubei University (Natural Science Edition), 2023, 45(02): 171-80.
KARTHIKEYAN S, ASOKAN P, NICKOLAS S. A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints [J]. The International Journal of Advanced Manufacturing Technology, 2014, 72(9-12) : 1567-79.
LONG X, ZHANG J, ZHOU K. Dynamic Self-Learning Artificial Bee Colony Optimization Algorithm for Flexible Job-Shop Scheduling Problem with Job Insertion [J]. Processes, 2022, 10(3): 571-.
CHEN H, IHLOW J, LEHMANN C. A genetic algorithm for flexible job-shop scheduling [J]. IEEE, 1999.
LUO S. Dynamic scheduling for flexible job shop with new job insertions by deep reinforcement learning [J]. Applied Soft Computing, 2020, 91(21): 106208.
Zhang Guohui, Gao Liang, Li Peigen. Improved genetic algorithm to solve flexible job shop scheduling problem [J]. Chinese Journal of Mechanical Engineering, 2009, 45(07): 145-51.
Meng Leilei. Modeling and optimization of flexible job shop scheduling problems for high efficiency and energy saving [D], 2020.
Li Tiek, Wang Weiling, Zhang Wenxue. Solving the flexible job shop scheduling problem based on cultural genetic algorithm [J]. Computer Integrated Manufacturing Systems, 2010, 16(04): 861-6.
SHI D, FAN W, XIAO Y. Intelligent scheduling of discrete automated production line via deep reinforcement learning [J]. International Journal of Production Research, 2020, (16): 1-19.
MIRJALILI S, MIRJALILI S M, LEWIS A. Gray Wolf Optimizer [J]. Advances in Engineering Software, 2014, 69(3): 46–61.
Xing Xiaoxi. Research progress of particle swarm algorithm [J]. Data Communications, 2015, (03): 19-21+30.
Liu Xingda. Research on workshop scheduling problem based on improved artificial bee colony algorithm [D], 2023.
Ji Jingjing. Harmony search algorithm and its application in vehicle routing problems [D], 2023.
Zhang Xi, Liu Mingzhou. Mixed distribution estimation algorithm for solving flexible job shop scheduling problems [J]. Systems Science and Mathematics, 2017, 37(01): 89-99.
Zhao Tianrui. Research on dynamic scheduling problem of flexible job shop based on deep reinforcement learning [D], 2023.
Cheng Jinhai. Research on flexible job shop scheduling based on swarm intelligence algorithm [D], 2023.
Li Rui, Xu Hua, Yang Jinfeng. Improved nearest neighbor artificial bee colony algorithm to solve flexible job shop scheduling problem [J]. Computer Application Research, 2024, 41(02): 438-43.
Liang Jingjing. Flexible job shop scheduling based on improved harmony search algorithm [D], 2020.
Li Xianbao, Zhang Ke. Research on optimal dispatch of microgrid based on improved harmony search algorithm [J]. Journal of Northeast Electric Power University, 2022, 42(05): 83-9.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
