A workflow task scheduling algorithm based on parallel layering and priority

Yongyi Huang

International Journal of Manufacturing Technology and Management, 2025, vol. 39, issue 3/4/5, 260-272

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. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=145937 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:39:y:2025:i:3/4/5:p:260-272

Access Statistics for this article

More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().