Tree-Structured Task Allocation for Audit Team With Sequential and Parallel Execution via E-CARGO Model

Task allocation is a critical aspect of teamwork, especially in complex projects such as auditing. In audit task allocation, collaboration among team members is essential, as the success of the project depends not only on individual expertise but also on efficient teamwork. This process is closely related to the GMRA problem, a complex optimization challenge. This study tackles the challenges of task allocation in phased tasks and multitasking within auditing. We propose a sequential and parallel assignment method based on tree-structured tasks, formalized as the TSTA<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">sp</sub> problem. Through both theoretical and experimental analyses, we demonstrate its feasibility and effectiveness. Additionally, we introduce improvements using the Gurobi solver and validate their impact. The results show significant optimization in audit task allocation.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2025-01-01
DOI
https://doi.org/10.1109/tcss.2025.3605409
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Tree-Structured Task Allocation for Audit Team With Sequential and Parallel Execution via E-CARGO Model

Bing Huang, Haibin Zhu, Tianxing Wang, Juan Zuo
IEEE Transactions on Computational Social Systems
Cloud Computing and Resource Management
article

Tree-Structured Task Allocation for Audit Team With Sequential and Parallel Execution via E-CARGO Model

Bing Huang, Haibin Zhu, Tianxing Wang, Juan Zuo
article en

Abstract

Task allocation is a critical aspect of teamwork, especially in complex projects such as auditing. In audit task allocation, collaboration among team members is essential, as the success of the project depends not only on individual expertise but also on efficient teamwork. This process is closely related to the GMRA problem, a complex optimization challenge. This study tackles the challenges of task allocation in phased tasks and multitasking within auditing. We propose a sequential and parallel assignment method based on tree-structured tasks, formalized as the TSTA<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">sp</sub> problem. Through both theoretical and experimental analyses, we demonstrate its feasibility and effectiveness. Additionally, we introduce improvements using the Gurobi solver and validate their impact. The results show significant optimization in audit task allocation.

IEEE Transactions on Computational Social Systems
Nipissing University (CA), Nanjing Audit University (CN)
Openalex Percentile: Top 60%
Cloud Computing and Resource Management
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.