Searcharxiv⌕ Search

arXiv subjects

M. Abdullah Khokhar

Publications and source records attributed to M. Abdullah Khokhar.

2 recordsLinked to original sources

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

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 costs associated with the evolution of level-dependent quasi-birth-and-death (LD-QBD) processes, which are useful in modelling many multi-server systems. We derive analytical expressions for the Laplace-Stieltjes transforms (LSTs) of the distribution of total costs accumulated during the times the LD-QBD processes spend in a specified set of levels. We present algorithms for the numerical evaluation of these LSTs. We also give memory efficient versions of the algorithms and discuss their algorithmic complexity. To assess the robustness of the distribution of costs with respect to model parameters, we develop algorithms for the sensitivity analysis of the corresponding LSTs. To illustrate the application potential of our results, we construct LD-QBD example models for a finite capacity multi-server queueing systems with admissions policies including redirection, preemptive transfer, and guard-channel threshold. The analysis is based on a large dataset obtained from a tertiary referral hospital in Australia. We compute the long-run performance measures, the distribution of time until some number of beds become available following congestion, and the distribution of the associated costs. We present valuable insights into how the system behaves under the various policies. We also perform the sensitivity analysis of the distribution of costs with respect to model parameters.

math.PR↗

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

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 customers' experience, and ensuring efficient resource allocation. In this paper, we study the customers' waiting times in a finite-capacity service system with a finite number of parallel servers and a shared waiting area. We consider two customer types, Type 1 and Type 2, with dynamic admission priorities, dynamically evolving customer type, and abandonment. We model the system under such assumptions using a continuous-time Markov chain (CTMC) and develop a methodology based on Krylov subspace approximation methods to evaluate the conditional waiting time distributions of Type 1 and Type 2 customers in the system. This methodology (CTMC-Krylov) offers a scalable computational approach that is well suited for analysing large complex systems. Next, we model this system using a quasi-birth-and-death (QBD) process and derive analytical expressions building on matrix-analytic methods to evaluate the conditional and long-run waiting time distributions using recursion. We illustrate the practical applicability of our models in a hospital system through a suite of numerical examples based on a large dataset obtained from a tertiary referral hospital in Australia, considering two types of patients, complex (Type 1) and other (Type 2).

stat.AP↗