AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (16.1 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

An Intelligent Algorithm for Dynamic Scheduling of Parallel Machines Considering Multi-Task Collaboration in Order Processing

Pei Xie1Xiaoying Yang1( )Bo Li1Zhijie Pei1Fenghai Yang2
School of Mechatronics Engineering, Henan University of Science and Technology, Luoyang, 471003, China
Luoyang Bearing Research Institute Co., Ltd., Luoyang, China
Show Author Information

Abstract

To address the critical requirements for collaborative delivery of multiple tasks within each order in personalized mass customization, this paper develops a dynamic parallel machine scheduling model that accounts for stochastic machine failures and order priorities, thereby more accurately reflecting the uncertainties and complexities of real-world production environments. A dual-objective optimization framework is adopted to minimize both the makespan (maximum task completion time) and the variance of task completion times, aiming to improve the coordination and reliability of intra-order task delivery. An adaptive weighted reward function is designed to balance overall scheduling efficiency with consistency among tasks during reinforcement learning training. To tackle the challenges posed by partially observable Markov decision processes (POMDP) induced by unexpected machine breakdowns, a Gated Recurrent Unit (GRU)-embedded Proximal Policy Optimization (PPO) intelligent scheduling algorithm is proposed. The algorithm incorporates an Action Masking mechanism to prevent invalid scheduling actions, while the GRU module captures historical state sequences to enhance perception of dynamic production environments. Extensive validation on benchmark datasets, along with comparisons against traditional heuristic algorithms, metaheuristic algorithms, and other deep reinforcement learning methods, demonstrates that the proposed approach achieves robust convergence, high resilience, and strong generalization across both static and dynamic scenarios, significantly improving coordinated delivery performance of order tasks. Overall, the proposed method not only provides an efficient and scalable real-time decision-making solution for Parallel Machine Scheduling Problems (PMSP) but also offers new theoretical and practical insights for optimizing complex production scheduling in intelligent manufacturing systems.

References

【1】
【1】
 
 
Computers, Materials & Continua
Article number: 33

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Xie P, Yang X, Li B, et al. An Intelligent Algorithm for Dynamic Scheduling of Parallel Machines Considering Multi-Task Collaboration in Order Processing. Computers, Materials & Continua, 2026, 88(3): 33. https://doi.org/10.32604/cmc.2026.083100

9

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 29 March 2026
Accepted: 28 May 2026
Published: 23 July 2026
© The Author 2026.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.