Dynamic Multi-Product Integrated Scheduling Algorithm with Urgent Delivery Date

Gardado en:
Detalles Bibliográficos
Publicado en:Electronics vol. 14, no. 4 (2025), p. 693
Autor Principal: Guo, Jianing
Outros autores: Wang, Dadong, Zhou, Wei, Xie, Zhiqiang, Sun, Ming, Tan, Zhenjiang
Publicado:
MDPI AG
Materias:
Acceso en liña:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Etiquetas: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

MARC

LEADER 00000nab a2200000uu 4500
001 3171007076
003 UK-CbPIL
022 |a 2079-9292 
024 7 |a 10.3390/electronics14040693  |2 doi 
035 |a 3171007076 
045 2 |b d20250101  |b d20251231 
084 |a 231458  |2 nlm 
100 1 |a Guo, Jianing  |u School of Mathmatics and Computer Science, Jilin Normal University, Siping 136000, China; <email>guo@mails.jlnu.edu.cn</email> (J.G.); <email>tanzj@jlnu.edu.cn</email> (Z.T.) 
245 1 |a Dynamic Multi-Product Integrated Scheduling Algorithm with Urgent Delivery Date 
260 |b MDPI AG  |c 2025 
513 |a Journal Article 
520 3 |a For the existing multi-product integrated scheduling algorithm considering the delivery date, the inability to fully consider the processing order of multiple products and the potential scheduling conflicts in the processing process causes problems such as equipment resource competition during the processing of products, ultimately resulting in the extension of delivery date and the failure to the deliver products on time. Aiming at this problem, a dynamic multi-product integrated scheduling algorithm with tight delivery date (ISA-TDD) is proposed. Firstly, the initial scheduling scheme of multi-product is established according to the strategy of ‘device priority + short time + layer priority’. Secondly, the product contribution value strategy is proposed to determine the scheduling order of multiple products and improve the parallel processing of products. Finally, the dynamic adjustment strategy of the game process is proposed, which solves the conflict problem of multi-product co-processing and further improves the intensity of compact scheduling of equipment. The comparative experimental results show that the algorithm achieves the optimization goal of shorter multi-product delivery date and higher overall utilization rate of equipment, and the scheduling effect is obviously better than the comparison algorithm. 
653 |a Scheduling 
653 |a Parallel processing 
653 |a Algorithms 
653 |a Integer programming 
653 |a Strategy 
653 |a Industrial development 
653 |a Manufacturing 
653 |a Critical path 
653 |a Optimization algorithms 
700 1 |a Wang, Dadong  |u School of Mathmatics and Computer Science, Jilin Normal University, Siping 136000, China; <email>guo@mails.jlnu.edu.cn</email> (J.G.); <email>tanzj@jlnu.edu.cn</email> (Z.T.) 
700 1 |a Zhou, Wei  |u School of Mathmatics and Computer Science, Jilin Normal University, Siping 136000, China; <email>guo@mails.jlnu.edu.cn</email> (J.G.); <email>tanzj@jlnu.edu.cn</email> (Z.T.) 
700 1 |a Xie, Zhiqiang  |u School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China; <email>xiezhiqiang@hrbust.edu.cn</email> 
700 1 |a Sun, Ming  |u School of History and Culture, Jilin Normal University, Siping 136000, China; <email>jlspsunming@jlnu.edu.cn</email> 
700 1 |a Tan, Zhenjiang  |u School of Mathmatics and Computer Science, Jilin Normal University, Siping 136000, China; <email>guo@mails.jlnu.edu.cn</email> (J.G.); <email>tanzj@jlnu.edu.cn</email> (Z.T.) 
773 0 |t Electronics  |g vol. 14, no. 4 (2025), p. 693 
786 0 |d ProQuest  |t Advanced Technologies & Aerospace Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3171007076/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text + Graphics  |u https://www.proquest.com/docview/3171007076/fulltextwithgraphics/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3171007076/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch