LAPSE:2023.2226
Published Article

LAPSE:2023.2226
Research on Multi-Equipment Collaborative Scheduling Algorithm under Composite Constraints
February 21, 2023
Abstract
Multi-equipment multi-process frequent scheduling under complex constraints is at the root of a large number of idle time fragments and transport waiting time in multi-equipment processes. To improve equipment utilization and reduce idle transportation time, a production process optimization scheduling algorithm with “minimum processing time and minimum transportation time” is proposed. Taking into account factors such as product priority, equipment priority, process priority, and overall task adjustment, the scheduling optimization is carried out through a hybrid algorithm combining a one-dimensional search algorithm and a dual NSGA-II algorithm. Compared with other algorithms, the scheduling algorithm proposed in this article not only shortens the minimum processing time but also strives to maximize the utilization rate of each piece of equipment, reducing the processing time of the enterprise by 8% or more, while also reducing the overall transportation time and indirectly reducing costs. The superiority of this algorithm is verified through practice, showing that that the complexity of the scheduling process is lower, and it is feasible in actual operation.
Multi-equipment multi-process frequent scheduling under complex constraints is at the root of a large number of idle time fragments and transport waiting time in multi-equipment processes. To improve equipment utilization and reduce idle transportation time, a production process optimization scheduling algorithm with “minimum processing time and minimum transportation time” is proposed. Taking into account factors such as product priority, equipment priority, process priority, and overall task adjustment, the scheduling optimization is carried out through a hybrid algorithm combining a one-dimensional search algorithm and a dual NSGA-II algorithm. Compared with other algorithms, the scheduling algorithm proposed in this article not only shortens the minimum processing time but also strives to maximize the utilization rate of each piece of equipment, reducing the processing time of the enterprise by 8% or more, while also reducing the overall transportation time and indirectly reducing costs. The superiority of this algorithm is verified through practice, showing that that the complexity of the scheduling process is lower, and it is feasible in actual operation.
Record ID
Keywords
collaborative operation, compound constraints, hybrid algorithm, multi-equipment, Scheduling
Subject
Suggested Citation
Kang P, Deng H, Wang X. Research on Multi-Equipment Collaborative Scheduling Algorithm under Composite Constraints. (2023). LAPSE:2023.2226
Author Affiliations
Kang P: Department of Network Security and Data, Xijing University, Xi’an 710123, China
Deng H: College of Communications Media, Xijing University, Xi’an 710123, China
Wang X: College of Bussiness, Xijing University, Xi’an 710123, China
Deng H: College of Communications Media, Xijing University, Xi’an 710123, China
Wang X: College of Bussiness, Xijing University, Xi’an 710123, China
Journal Name
Processes
Volume
10
Issue
6
First Page
1171
Year
2022
Publication Date
2022-06-10
ISSN
2227-9717
Version Comments
Original Submission
Other Meta
PII: pr10061171, Publication Type: Journal Article
Record Map
Published Article

LAPSE:2023.2226
This Record
External Link

https://doi.org/10.3390/pr10061171
Publisher Version
Download
Meta
Record Statistics
Record Views
613
Version History
[v1] (Original Submission)
Feb 21, 2023
Verified by curator on
Feb 21, 2023
This Version Number
v1
Citations
Most Recent
This Version
URL Here
https://psecommunity.org/LAPSE:2023.2226
Record Owner
Auto Uploader for LAPSE
Links to Related Works
(0.08 seconds)
[0.09 s]
