Efficient allocation of shared resources across multiple processes

Effective resource allocation is crucial for optimizing business processes. Yet, most existing methods focus solely on single-process optimization, overlooking the interdependencies present in multi-process environments. This limitation results in inefficient resource allocation, and scalability challenges. To address this gap, we propose MuProMAC (Multi-Process Multi-Agent Coordination), a novel reinforcement learning-based method designed to optimize resource allocation across multiple interdependent business processes. Unlike prior methods, MuProMAC is the first online resource allocation method that explicitly models the interdependencies between processes and dynamically balances competing resource demands to minimize global average cycle time. We evaluate our method in five multi-process scenarios with different levels of resource contention, comparing it against state-of-the-art online resource allocation methods and three simple baselines. Our results show that MuProMAC is consistently among the top-performing methods in shared-resource environments. It achieves low cycle times and stable performance across different workload conditions, outperforming existing methods through its strong adaptability to evolving business processes and increasing complexity.

Authors

Institutions

Publication Details

Journal
Information Systems
Published
2025-12-06
DOI
https://doi.org/10.1016/j.is.2025.102663
Primary Topic
Business Process Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient allocation of shared resources across multiple processes

Kiran Busch, Henrik Leopold
Information Systems
Business Process Modeling and Analysis
article

Efficient allocation of shared resources across multiple processes

Kiran Busch, Henrik Leopold
article en

Abstract

Effective resource allocation is crucial for optimizing business processes. Yet, most existing methods focus solely on single-process optimization, overlooking the interdependencies present in multi-process environments. This limitation results in inefficient resource allocation, and scalability challenges. To address this gap, we propose MuProMAC (Multi-Process Multi-Agent Coordination), a novel reinforcement learning-based method designed to optimize resource allocation across multiple interdependent business processes. Unlike prior methods, MuProMAC is the first online resource allocation method that explicitly models the interdependencies between processes and dynamically balances competing resource demands to minimize global average cycle time. We evaluate our method in five multi-process scenarios with different levels of resource contention, comparing it against state-of-the-art online resource allocation methods and three simple baselines. Our results show that MuProMAC is consistently among the top-performing methods in shared-resource environments. It achieves low cycle times and stable performance across different workload conditions, outperforming existing methods through its strong adaptability to evolving business processes and increasing complexity.

Information SystemsVol. 138
Kühne Logistics University (DE)
Openalex Percentile: Top 44%
Business Process Modeling and Analysis
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.

Efficient allocation of shared resources across multiple processes — Kiran Busch, Henrik Leopold · Information Systems (2025) | TGRS Research Map | TGRS