arrow
Return

Task allocation for maximum cooperation in complex structured business processes

delete2024-09-01
delete0
delete
OA
AI
王娇娇 cover
王娇娇 (Jiaojiao Wang)
D
Dongjin Yu *
C
Chengfei Liu
DOI:10.1016/j.knosys.2024.111989delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
The execution of a business process usually involves the cooperation of many resources (actors) performing various tasks (activities). Generally speaking, the cooperation among actors could significantly influence the efficiency of process execution. The better cooperation among actors, the higher performance the process instance would achieve. The task allocation is, therefore, expected to ensure that the actors are compatible well with each other when performing tasks. However, the decision of task allocation is always ad-hoc or performed manually in many organizations. As for some automatic methods, they usually serve only for sequentially structured simple processes. In addition, the existing studies only concentrate on the cooperation between two actors and fail to consider the effects from the context of performing different tasks by these two actors especially in the business process with many-to-many relationships among the resources and activities. To address these issues, we handle the process with complex block structures including iteration, choice and parallelism, and propose an effective entity-wise method to measure the cooperation by combining both actors and activities together. Based on them, we present two approaches, one greedy-based and the other A*-based, to assign actors for maximum cooperation in the complex structured business process with many-to-many relationships among the resources and activities. The experimental results on both public released and synthetic datasets demonstrate the effectiveness and efficiency of our approaches.
Keywords:
Business process optimization
Task allocation
Cooperation
Structured business process
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

H
Hangzhou Dianzi University
Scholars:
1.3W
Papers: 9.6K
Citations: 7.5K
S
Swinburne University of Technology
Scholars:
9.3K
Papers: 1.2W
Citations: 2.0W
Cited Papers

Cited Papers

Task Allocation of Multiagent Groups in Social Networked Systems
err2022-07-15
err8
PREAI
errLi, Kai; Wu, Sentang; Wen, Yongming; Wang, Ying
errShare
errSave
EDQWS: an enhanced divide and conquer algorithm for workflow scheduling in cloud
err2022-05-26
err27
errOAAI
errKhojasteh Toussi, Ghazaleh; Naghibzadeh, Mahmoud; Abrishami, Saeid; Taheri, Hoda; Abrishami, Hamid
errShare
errSave
Workflow Refactoring for Maximizing Concurrency and Block-Structuredness
err2021-07-01
err6
PREAI
errSong, Wei; Jacobsen, Hans-Arno; Cheung, S. C.; Liu, Hongyu; Ma, Xiaoxing
errShare
errSave
Assign and Appraise: Achieving Optimal Performance in Collaborative Teams
err2023-03-01
err3
errOAAI
errHuang, Elizabeth Y.; Paccagnan, Dario; Mei, Wenjun; Bullo, Francesco
errShare
errSave
Hyper-heuristic local search for combinatorial optimisation problems
err2020-10-01
err24
PREAI
errTurky, Ayad; Sabar, Nasser R.; Dunstall, Simon; Song, Andy
errShare
errSave
Energy-aware scientific workflow scheduling in cloud environment
err2022-05-18
err15
PREAI
errChoudhary, Anita; Govil, Mahesh Chandra; Singh, Girdhari; Awasthi, Lalit K.; Pilli, Emmanuel S.
errShare
errSave
researcher View more