Title: A workflow task scheduling algorithm based on parallel layering and priority

Authors: Yongyi Huang

Addresses: Nanyang Medical College, Nanyang, 473000, China

Abstract: This study aims to improve the overall execution efficiency of the system by dividing workflow tasks into multiple levels and executing tasks at different levels simultaneously. Firstly, a parallel layered approach is adopted to partition the execution order of tasks, construct a task dependency graph, and dynamically adjust task granularity based on computational complexity to avoid conflicts and competition between tasks. Secondly, based on the results of workflow task partitioning, calculate task priorities and arrange each task in priority order. Finally, based on the calculation of priority, a greedy algorithm is used for workflow scheduling. The experimental results show that the algorithm can effectively utilise parallel computing resources, optimise the execution order of tasks, reduce task waiting time, and improve the overall load balancing and resource utilisation of the system, thereby enhancing the task scheduling effect and performance of the workflow system.

Keywords: parallel layering; priority; workflow; task scheduling; task dependency graph; greedy algorithm.

DOI: 10.1504/IJMTM.2025.145937

International Journal of Manufacturing Technology and Management, 2025 Vol.39 No.3/4/5, pp.260 - 272

Received: 22 Dec 2023
Accepted: 03 Jun 2024
Published online: 30 Apr 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article