arrow
返回

Task allocation for maximum cooperation in complex structured business processes

delete2024-09-01
delete0
delete
OA
AI
王娇娇 封面图
王娇娇 (Jiaojiao Wang)
D
Dongjin Yu *
C
Chengfei Liu
DOI:10.1016/j.knosys.2024.111989delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

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.
Keyword:
Business process optimization
Task allocation
Cooperation
Structured business process
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

H
Hangzhou Dianzi University
学者数:
1.3W
论文数: 9.6K
被引数: 7.5K
S
Swinburne University of Technology
学者数:
9.3K
论文数: 1.2W
被引数: 2.0W
引用论文

引用论文

Task Allocation of Multiagent Groups in Social Networked Systems
err2022-07-15
err8
PREAI
errLi, Kai; Wu, Sentang; Wen, Yongming; Wang, Ying
err分享
err收藏
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
err分享
err收藏
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
err分享
err收藏
Assign and Appraise: Achieving Optimal Performance in Collaborative Teams
err2023-03-01
err3
errOAAI
errHuang, Elizabeth Y.; Paccagnan, Dario; Mei, Wenjun; Bullo, Francesco
err分享
err收藏
err分享
err收藏
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.
err分享
err收藏
学者 查看更多内容