journal article·2025-12Open access

Research on flexible weaving planning based on NSGA-II algorithm

Ning Dai, Wenkang Wu, Kaixin Xu, Xudong Hu, Yanhong Yuan, Laihu Peng, Yushan Xu, Pengyuan Gan

Abstract

Facing the shift in the weaving industry from mass production to a more diversified, small-batch production model, traditional production scheduling systems are no longer capable of meeting the demand for rapid market response. To address this issue, this paper first analyzes the production process of a weaving workshop, identifying key scheduling challenges such as order allocation, equipment selection, and operation sequencing. Based on this analysis, a flexible job shop multi-objective scheduling model tailored for weaving workshops is developed. To handle the multiple constraints and optimization goals inherent in the model, an improved NSGA-II algorithm is proposed. This algorithm combines artificial bee colony (ABC) algorithm for population initialization with simulated annealing (SA) for population filtering. Simulation examples and case studies from actual workshops demonstrate that the improved NSGA-II algorithm outperforms other algorithms in solving the scheduling problem for weaving workshops. The proposed multi-objective scheduling model and its improved algorithm provide accurate and efficient optimization solutions for workshop scheduling.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Manufacturing Process and Optimization

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Key Laboratory of Modern Textile Machinery & Technology of Zhejiang Province, Zhejiang Sci-Tech University, Hangzhou, China

Zhejiang Kangli Automation Technology Co, Ltd, Shaoxing, China

Funding

Zhejiang Provincial Department of Education Research Project · Te Science and Technology Program of Zhejiang Province, China · Zhejiang Sci-Tech University Research Start-up Fund, China

References (37)

Show source-provided references
1. 10.3390/polym1301013410.3390/polym13010134 ↗
2. 10.1109/ACCESS.2021.310041010.1109/ACCESS.2021.3100410 ↗
3. 10.1016/j.matlet.2022.13204710.1016/j.matlet.2022.132047 ↗
4. 10.3390/ma1417511310.3390/ma14175113 ↗
5. 10.1108/IJOA-11-2012-062510.1108/IJOA-11-2012-0625 ↗
6. 10.3390/electronics1123404910.3390/electronics11234049 ↗
7. 10.1177/004051752094889610.1177/0040517520948896 ↗
8. 10.32604/csse.2021.01657810.32604/csse.2021.016578 ↗
9. 10.1177/0040517522112987310.1177/00405175221129873 ↗
10. 10.1016/j.jmsy.2021.01.00910.1016/j.jmsy.2021.01.009 ↗
11. 10.5829/IJE.2024.37.04A.1210.5829/IJE.2024.37.04A.12 ↗
12. 10.3390/app1118831210.3390/app11188312 ↗
13. 10.2478/ftee-2022-003610.2478/ftee-2022-0036 ↗
14. 10.1007/978-3-030-85874-2_4510.1007/978-3-030-85874-2_45 ↗
15. 10.1016/j.cirpj.2015.01.00110.1016/j.cirpj.2015.01.001 ↗
16. 10.1177/002029402094494710.1177/0020294020944947 ↗
17. Yilmaz OF · International Journal of Industrial Engineering · 2019 · 26 · 1
18. 10.1016/j.engappai.2022.10531110.1016/j.engappai.2022.105311 ↗
19. 10.3390/s2204141010.3390/s22041410 ↗
20. 10.1007/978-981-16-1220-6_3210.1007/978-981-16-1220-6_32 ↗
21. 10.1007/s42452-020-2047-210.1007/s42452-020-2047-2 ↗
22. 10.3390/s2224971610.3390/s22249716 ↗
23. 10.1016/j.cie.2020.10677810.1016/j.cie.2020.106778 ↗
24. 10.3390/polym1303047110.3390/polym13030471 ↗
25. 10.1016/0377-2217(90)90309-Y10.1016/0377-2217(90)90309-Y ↗
26. 10.1016/j.cie.2021.10754210.1016/j.cie.2021.107542 ↗
27. 10.3390/electronics1008096710.3390/electronics10080967 ↗
28. 10.1016/j.chaos.2021.11066910.1016/j.chaos.2021.110669 ↗
29. 10.32604/cmc.2020.0867410.32604/cmc.2020.08674 ↗
30. 10.1016/j.ins.2020.07.03710.1016/j.ins.2020.07.037 ↗
31. Sarumaha YA · Technology and Engineering · 2023 · 1 · 11
32. 10.1007/s00500-020-05527-x10.1007/s00500-020-05527-x ↗
33. 10.1016/j.ymssp.2019.10645210.1016/j.ymssp.2019.106452 ↗
34. 10.1177/036119812091242210.1177/0361198120912422 ↗
35. 10.1007/s00521-020-05398-110.1007/s00521-020-05398-1 ↗
36. 10.1016/j.asoc.2022.10894710.1016/j.asoc.2022.108947 ↗
37. 10.1016/j.asoc.2021.10740410.1016/j.asoc.2021.107404 ↗