Inference for double Pareto lognormal queues with applications [PDF]
In this article we describe a method for carrying out Bayesian inference for the double Pareto lognormal (dPlN) distribution which has recently been proposed as a model for heavy-tailed phenomena. We apply our approach to inference for the dPlN/M/1 and M/
Michael P. Wiper +3 more
core
On a Multiclass Arrival Retrial MK/GK/1/r Queueing System with Finite Buffer
, 2001 A single-server retrial queueing system with ̄nite bu®er and multidimensional Poisson °ow of customers is considered. The probability distribution functions of service times are arbitrary and di®erent for each type of customers.
P. P. BOCHAROV +3 more
core
Bayes, Neyman and Neyman-Bayes Inference for Queueing Systems [PDF]
In this paper we will use the Bayesian inference for the parameters that appear in the queueing systems. We will estimate these parameters and we will build confidence intervals and significance tests for them, considering the parameters of the ...
Ciuiu, Daniel
core
Differential evolution to solve the lot size problem. [PDF]
An Advanced Resource Planning model is presented to support optimal lot size decisions for performance improvement of a production system in terms of either delivery time or setup related costs. Based on a queueing network, a model is developed for a mix
Lieckens, Kris, Vandaele, Nico
core
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 SystAcharya SR, Ghimire S, Ghimire RP.
europepmc +1 more source
Reliability and performance modeling of an M[X]/G(a,b)/1 retrial queue with re-service and Balking behavior under working vacation policy. [PDF]
PLoS OneS S, S N.
europepmc +1 more source
Adaptive queue management in healthcare using supervised Q-learning with time-varying reward and cost structures. [PDF]
Sci RepBag K +4 more
europepmc +1 more source
A tight bound on the throughput of queueing networks with blocking [PDF]
In this paper, we present a bounding methodology that allows to compute a tight lower bound on the cycle time of fork--join queueing networks with blocking and with general service time distributions. The methodology relies on two ideas.
SEMAL, Pierre +2 more
core
Real-time healthcare staffing optimization using fuzzy logic and genetic algorithm. [PDF]
Health Econ RevSaini B, Saini DK.
europepmc +1 more source
Statistical Analysis of a Telephone Call Center: A Queueing-Science Perspective [PDF]
A call center is a service network in which agents provide telephone-based services. Customers that seek these services are delayed in tele-queues. This paper summarizes an analysis of a unique record of call center operations.
Noah Gans +7 more
core