Improved Genetic Algorithm for Solving the Order Scheduling Problem of Structural Parts Workshop

Jiajun Zhang; Yinghua Liao

doi:10.54097/zq54fd50

Authors

Jiajun Zhang
Yinghua Liao

DOI:

https://doi.org/10.54097/zq54fd50

Keywords:

Intelligent terminal structure, Non-uniform crossing, Non-uniform mutation, Genetic algorithms

Abstract

In view of the problem that the workshop of intelligent terminal structural parts is faced with the disturbance caused by urgent orders affecting the production efficiency and delivery punctuality of the workshop, combined with the initial scheme minimization index and the order insertion rescheduling delay minimization index, a mathematical model of order insertion scheduling in the production workshop of intelligent terminal structural parts is established; And genetic algorithm is used to solve it, dynamically adjusting the probability of non-uniform crossover and non-uniform mutation to improve the coverage of the search space and avoid getting stuck in local optimal solutions. The results show that compared with the traditional manual decision-making scheduling, the proposed scheduling scheme improves by 7.67%, 3.4%, 10.89% and 15.5% respectively on different orders. The scheduling scheme can effectively cope with the disturbance impact caused by order insertion and shorten the production cycle.

Downloads

Download data is not yet available.

References

[1] Yan Haoyun, Li Hongyu. Rush order inserting problem based on load-oriented manufacturing control technique [J]. Computer Integrated Manufacturing Systems, 2009, 15(09):1809-1815. DOI:10.13196/j.cims.2009.09.147.yanhy.025

[2] Zakaria Z, Petrovic S. Genetic algorithms for match-up rescheduling of the flexible manufacturing systems [J]. Computers & Industrial Engineering, 2012, 62 (2): 670-686

[3] Gao Kaizhou, Suganthan P N, Tasgetiren M F, et al. Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion [J]. Computers & Industrial Engineering, 2015, 90 (12): 107-117

[4] Gao Kaizhou, Suganthan P N, Chua T J, et al. A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion [J]. Expert Systems with Applications, 2015, 42 (21):7652-7663.

[5] ZHANG M, TAO F, NEE A Y C. Digital twin enhanced dynamic job-shop scheduling [J]. Journal of Manufacturing System, 2021, 58, Part B:145-156.

[6] CHEN F Y, et al. "Textile Flexible Job-Shop Scheduling Based on a Modified Ant Colony Optimization Algorithm." Applied Sciences 14.10 (2024): 4082.

[7] WU M L, DONG S Y, and TIAN Y L. "An improved particle swarm algorithm with the elite retain strategy for solving flexible jobshop scheduling problem." Journal of Physics: Conference Series. Vol. 2173. No. 1. IOP Publishing, 2022.

[8] ZHONG C T, GANG L, ZENG M. "Belugawhaleoptimization: Anovelnature-inspiredmetaheuristicalgorithm." Knowledge-BasedSystems251 (2022):109215.

[9] JIANG B, et al. "A Review on Intelligent Scheduling and Optimization for Flexible Job Shop." International Journal of Control, Automation and Systems 21.10 (2023): 3127-3150.