Proactive Acquisition of Workshop Material Tasks Based on the CTB Strategy

To address the challenges of dynamic task scheduling and path optimization in modern manufacturing workshop environments, this paper proposes a material delivery method based on a Concurrent Task-Based (CTB) proactive acquisition strategy. This strategy enables intelligent transport carriers to acquire new tasks in real-time during task execution and utilizes an improved NSGA-II algorithm for multi-objective optimization, thereby maximizing resource utilization. The performance of the traditional NSGA-II algorithm, the improved NSGA-II algorithm, and the greedy algorithm were compared through experiments. The results indicate that the improved NSGA-II algorithm outperforms in terms of task completion rate, idle rate, and path optimization, demonstrating superior adaptability and efficiency. This study offers a reference solution to the task scheduling problem in dynamic workshop environments and shows significant potential for practical application.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/icemce64157.2024.10862041
Primary Topic
Manufacturing Process and Optimization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Proactive Acquisition of Workshop Material Tasks Based on the CTB Strategy

Zihan Li, Yifan Pang, Geng Zhang, Gang Wang
Manufacturing Process and Optimization
article

Proactive Acquisition of Workshop Material Tasks Based on the CTB Strategy

Zihan Li, Yifan Pang, Geng Zhang, Gang Wang
article en

Abstract

To address the challenges of dynamic task scheduling and path optimization in modern manufacturing workshop environments, this paper proposes a material delivery method based on a Concurrent Task-Based (CTB) proactive acquisition strategy. This strategy enables intelligent transport carriers to acquire new tasks in real-time during task execution and utilizes an improved NSGA-II algorithm for multi-objective optimization, thereby maximizing resource utilization. The performance of the traditional NSGA-II algorithm, the improved NSGA-II algorithm, and the greedy algorithm were compared through experiments. The results indicate that the improved NSGA-II algorithm outperforms in terms of task completion rate, idle rate, and path optimization, demonstrating superior adaptability and efficiency. This study offers a reference solution to the task scheduling problem in dynamic workshop environments and shows significant potential for practical application.

Northwestern Polytechnical University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 60%
Manufacturing Process and Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.