activity
20232026
collaborators

6 papers

stat.AP2026

Waiting time analysis in a finite-capacity multi-server systems with dynamic priorities, dynamically evolving customer types, and abandonment

M. Abdullah Khokhar, Malgorzata M. O'Reilly, Richard Turner

In many service systems, an estimation of customers' waiting times for the service can assist in decision making focused on enhancing the operational efficiency, improving the cust…

math.PR2026

Level-dependent quasi-birth-and-death processes: Application to cost analysis of multi-server systems

M. Abdullah Khokhar, Malgorzata M. O'Reilly, Richard Turner

Analysing costs is crucial for optimising the operational efficiency and resource allocation in systems evolving under uncertainty. In this paper, we study the distribution of cost…

math.PR2026

Sensitivity analysis of Stochastic Fluid Models: Stationary and transient quantities with applications

Anna Aksamit, Małgorzata M. O'Reilly, Zbigniew Palmowski

We establish results for the first sensitivity analysis of the stochastic fluid models (SFMs). We derive expressions for the sensitivity analysis of the key stationary and transien…

cs.LG2026

Early predicting of hospital admission using machine learning algorithms: Priority queues approach

Jakub Antczak, James Montgomery, Małgorzata O'Reilly +2

Emergency Department overcrowding is a critical issue that compromises patient safety and operational efficiency, necessitating accurate demand forecasting for effective resource a…

math.OC2024

Markov Decision Process and Approximate Dynamic Programming for a Patient Assignment Scheduling problem

Malgorzata M. O'Reilly, Sebastian Krasnicki, James Montgomery +4

We study the Patient Assignment Scheduling (PAS) problem in a random environment that arises in the management of patient flow in the hospital systems, due to the stochastic nature…

math.PR2023

A Stochastic Fluid Model Approach to the Stationary Distribution of the Maximum Priority Process

Hiska M. Boelema, Daan J. J. Dams, Malgorzata M. O'Reilly +2

In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a…