Searcharxiv⌕ Search

arXiv subjects

I. J. B. F. Adan

Publications and source records attributed to I. J. B. F. Adan.

3 recordsLinked to original sources

Learning policies for resource allocation in business processes

Efficient allocation of resources to activities is pivotal in executing business processes but remains challenging. While resource allocation methodologies are well-established in domains like manufacturing, their application within business process management remains limited. Existing methods often do not scale well to large processes with numerous activities or optimize across multiple cases. This paper aims to address this gap by proposing two learning-based methods for resource allocation in business processes to minimize the average cycle time of cases. The first method leverages Deep Reinforcement Learning (DRL) to learn policies by allocating resources to activities. The second method is a score-based value function approximation approach, which learns the weights of a set of curated features to prioritize resource assignments. We evaluated the proposed approaches on six distinct business processes with archetypal process flows, referred to as scenarios, and three realistically sized business processes, referred to as composite business processes, which are a combination of the scenarios. We benchmarked our methods against traditional heuristics and existing resource allocation methods. The results show that our methods learn adaptive resource allocation policies that outperform or are competitive with the benchmarks in five out of six scenarios. The DRL approach outperforms all benchmarks in all three composite business processes and finds a policy that is, on average, 12.7% better than the best-performing benchmark.

cs.AI↗

Optimal routing in two-queue polling systems

We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a Poisson process. We study the control problem of how arrivals should be routed to the two queues in order to minimize expected waiting costs and characterize individually and socially optimal routing policies under three scenarios of available information at decision epochs: no, partial and complete information. In the complete information case, we develop a new iterative algorithm to determine individually optimal policies, and show that such policies can be described by a switching curve. We conjecture that a linear switching curve is socially optimal, and prove that this policy is indeed optimal for the fluid version of the two-queue polling system.

math.PR↗

The analysis of batch sojourn-times in polling systems

We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For the locally-gated, globally-gated, and exhaustive service disciplines, we study the batch sojourn-time, which is defined as the time from an arrival epoch until service completion of the last customer in the batch. We obtain for the different service disciplines exact expressions for the Laplace-Stieltjes transform of the steady-state batch sojourn-time distribution, which can be used to determine the moments of the batch sojourn-time, and in particular, its mean. However, we also provide an alternative, more efficient way to determine the mean batch sojourn-time, using Mean Value Analysis. Finally, we compare the batch sojourn-times for the different service disciplines in several numerical examples. Our results show that the best performing service discipline, in terms of minimizing the batch sojourn-time, depends on system characteristics.

math.PR↗