Learning From Queues: Operational Analysis and Performance Evaluation of Dialysis Duration in a Paired Kidney Exchange With an <i>M/M</i>/1 System. [PDF]
Learn Health SystABSTRACT Introduction The allocation and timing for kidney matching and transplantation among incompatible donor‐recipient pairs in the Paired Kidney Exchange face significant operational challenges of managing an uncertain waitlist. The time for dialysis of patients waiting for biologically compatible kidneys follows the concept of a stochastic ...
Acharya SR, Ghimire S, Ghimire RP.
europepmc +2 more sources
A study of some M[x]/G/1 type queues with random breakdowns and bernouilli schedule server vacations based on a single vacation policy [PDF]
, 2008 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Queueing systems arise in modelling of many practical applications related to computer sciences, telecommunication networks, manufacturing and production ...
Maraghi, Farzana Abdulla
core +7 more sources
On some queueing systems with server vacations, extended vacations, breakdowns, delayed repairs and stand-bys [PDF]
, 2012 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.This research investigates a batch arrival queueing system with a Bernoulli scheduled vacation and random system breakdowns.
Khalaf, Rehab
core +7 more sources
Optimizing Cardiac Inpatient Flow and Resource Allocation in Low-Resource Settings Using Queuing Theory: Insights From a Tertiary Hospital in Bangladesh. [PDF]
Public Health ChallThis study applies queuing theory models (M/M/c/c and M/M/c/K) to optimize inpatient flow and resource allocation in the cardiology department of Sylhet MAG Osmani Medical College Hospital, Bangladesh. Using data from 6,277 patients in 2023, it identifies bottlenecks in CCU and PCCU, highlights bed shortages and overcrowding, and proposes reallocating ...
Uddin MB +6 more
europepmc +2 more sources
Large deviations for the total queue size in non-Markovian tandem queues [PDF]
Queueing Systems, 2017 نحن نعتبر قائمة انتظار d - node جنبًا إلى جنب مع عملية الوصول وعمليات الخدمة ذات الذيل الخفيف في جميع قوائم الانتظار i.i.d. ومستقلة عن بعضها البعض. نحن نأخذ في الاعتبار ثلاثة أشكال لاحتمال أن يصل عدد العملاء في النظام إلى مستوى عالٍ N، أي خلال دورة مزدحمة، وفي حالة مستقرة، وعند وصول عميل جديد.
Anne Buijsrogge +3 more
openaire +2 more sources
A non‐Markovian queueing system with a variable number of channels [PDF]
International Journal of Stochastic Analysis, 2003 The authors focus their attention on the queueing process, which turns out to be semi-regenera\-tive relative to the sequence \(\{T_n\}\) of arrivals. They start with the embedded process over \(\{T_n\}\) and turn to the analysis of the queue as a semi-regenerative process. All formulae are obtained in analytically tractable forms.
Rosson, Hong-Tham T. +1 more
openaire +1 more source
Approximate solutions of stochastic differential delay equations with Markovian switching [PDF]
, 2010 Our main aim is to develop the existence theory for the solutions to stochastic differential delay equations with Markovian switching (SDDEwMSs) and to establish the convergence theory for the Euler-Maruyama approximate solutions under the local ...
Li, Xiaoyue, Shen, Yi, Mao, Xuerong
core +4 more sources
A Non‐Markovian Multistage Batch Arrival Queue with Breakdown and Reneging [PDF]
Mathematical Problems in Engineering, 2014 The present investigation deals with analysis of non‐Markovian queueing model with multistage of services. When the server is unavailable during the system breakdown (or) vacation periods, we consider reneging to prevail. Supplementary variable techniques have been adopted to obtain steady state system length distributions.
Maragathasundari, Sivagnanasundararam +1 more
openaire +2 more sources
Mathematics, 2023 We consider a non-standard class of Markovian time: varying infinite capacity queues with possibly heterogeneous servers and impatience. We assume that during service time, a customer may switch to the faster server (with no delay), when such a server ...
Yacov Satin +3 more
doaj +1 more source
Time-dependent analysis of virtual waiting time behaviour in discrete time queues [PDF]
, 2005 Discrete time queueing models have been shown previously to be of practical use for modelling the approximate time-dependent behaviour of queue length in systems of the form M(t)/G/c.
Wall, A, Worthington, D J
core +4 more sources