Economies-of-Scale in many-server queueing systems: tutorial and partial review of the QED halfin--whitt heavy-traffic regime
Multiserver queueing systems describe situations in which users require service from
multiple parallel servers. Examples include check-in lines at airports, waiting rooms in …
multiple parallel servers. Examples include check-in lines at airports, waiting rooms in …
Time-varying queues
W Whitt - Queueing models and service management, 2018 - par.nsf.gov
Service systems abound with queues, but the most natural direct models are often time-
varying queues, which may require nonstandard analysis methods beyond stochastic …
varying queues, which may require nonstandard analysis methods beyond stochastic …
Asymptotically optimal priority policies for indexable and nonindexable restless bandits
IM Verloop - 2016 - projecteuclid.org
We study the asymptotic optimal control of multi-class restless bandits. A restless bandit is a
controllable stochastic process whose state evolution depends on whether or not the bandit …
controllable stochastic process whose state evolution depends on whether or not the bandit …
Stochastic processing networks
RJ Williams - Annual Review of Statistics and Its Application, 2016 - annualreviews.org
Stochastic processing networks arise as models in manufacturing, telecommunications,
transportation, computer systems, the customer service industry, and biochemical reaction …
transportation, computer systems, the customer service industry, and biochemical reaction …
Scheduling an overloaded multiclass many-server queue with impatient customers
AL Puha, AR Ward - … research & management science in the …, 2019 - pubsonline.informs.org
We describe a fluid model with time-varying input that approximates a multiclass many-
server queue with impatient customers and time-varying arrivals (specifically, the multiclass …
server queue with impatient customers and time-varying arrivals (specifically, the multiclass …
Modeling abandonment behavior among patients
Researchers often utilize time-based models of queue abandonment. In such models,
researchers determine the length of time until abandonment by drawing from an exogenous …
researchers determine the length of time until abandonment by drawing from an exogenous …
A stochastic inventory model of COVID-19 and robust, real-time identification of carriers at large and infection rate via asymptotic laws
C Tsiligianni, A Tsiligiannis, C Tsiliyannis - European Journal of …, 2023 - Elsevier
A critical operations management problem in the ongoing COVID-19 pandemic is
cognizance of (a) the number of all carriers at large (CaL) conveying the SARS-CoV-2 …
cognizance of (a) the number of all carriers at large (CaL) conveying the SARS-CoV-2 …
Asymptotically optimal index policies for an abandonment queue with convex holding cost
M Larrañaga, U Ayesta, IM Verloop - Queueing systems, 2015 - Springer
We investigate a resource allocation problem in a multi-class server with convex holding
costs and user impatience under the average cost criterion. In general, the optimal policy …
costs and user impatience under the average cost criterion. In general, the optimal policy …
Performance evaluation, optimization and dynamic decision in blockchain systems: a recent overview
QL Li, YX Chang, Q Wang - arXiv preprint arXiv:2211.15907, 2022 - arxiv.org
With rapid development of blockchain technology as well as integration of various
application areas, performance evaluation, performance optimization, and dynamic decision …
application areas, performance evaluation, performance optimization, and dynamic decision …
Index policies for a multi-class queue with convex holding cost and abandonments
M Larrañaga, U Ayesta, IM Verloop - The 2014 ACM international …, 2014 - dl.acm.org
We investigate a resource allocation problem in a multi-class server with convex holding
costs and user impatience under the average cost criterion. In general, the optimal policy …
costs and user impatience under the average cost criterion. In general, the optimal policy …