Waiting time distributions in the preemptive accumulating priority queue
VA Fajardo, S Drekic - Methodology and Computing in Applied Probability, 2017 - Springer
We consider a queueing system in which a single server attends to N priority classes of
customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a …
customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a …
Finite-time ruin probabilities using bivariate Laguerre series
ECK Cheung, H Lau, GE Willmot… - Scandinavian Actuarial …, 2023 - Taylor & Francis
In this paper, we revisit the finite-time ruin probability in the classical compound Poisson risk
model. Traditional general solutions to finite-time ruin problems are usually expressed in …
model. Traditional general solutions to finite-time ruin problems are usually expressed in …
Strongly Tail-Optimal Scheduling in the Light-Tailed M/G/1
We study the problem of scheduling jobs in a queueing system, specifically an M/G/1 with
light-tailed job sizes, to asymptotically optimize the response time tail. This means …
light-tailed job sizes, to asymptotically optimize the response time tail. This means …
A reliability-based maintenance technicians' workloads optimisation model with stochastic consideration
The growing interest in technicians' workloads research is probably associated with the
recent surge in competition. This was prompted by unprecedented technological …
recent surge in competition. This was prompted by unprecedented technological …
On a general mixed priority queue with server discretion
VA Fajardo, S Drekic - Stochastic Models, 2016 - Taylor & Francis
We consider a single-server queueing system which attends to N priority classes that are
classified into two distinct types:(i) urgent: classes which have preemptive resume priority …
classified into two distinct types:(i) urgent: classes which have preemptive resume priority …
A Generalization of M/G/1 priority models via accumulating priority
VA Fajardo - 2016 - uwspace.uwaterloo.ca
Priority queueing systems are oftentimes set up so that arriving customers are placed into
one of $ N $ distinct priority classes. Moreover, to determine the order of service, each …
one of $ N $ distinct priority classes. Moreover, to determine the order of service, each …