This article derives amazingly accurate approximations to the state probabilities and waiting-time probabilities in the M0D01 queue using a two-phase process with negative probabilities to approximate the deterministic service time+ The approx-imations are in the form of explicit expressions involving geometric and exponen-tial terms+ The approximations extend to the finite-capacity M0D010N 1 queue+ 1
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G...
AbstractKeane, Hooghiemstra and Van de Ree have proposed a new numerical method for calculating stat...
This article derives amazingly accurate approximations to the state probabilities and waiting-time p...
This article shows that very accurate accurate approximations to performance measures in the multise...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
A single-server queueing system with negative customers is considered in this paper. One positive c...
This article deals with Bayesian inference and prediction for M/G/1 queueing systems. The general se...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Consideration is given to queueing system with Poisson flows of ordinary and negative customers. O...
AbstractThe M/G/2 queueing model with service time distribution a mixture of m negative exponential ...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
In many applications, significant correlations between arrivals of load-generating events make the n...
This article deals with Bayesian inference and prediction for M/G/1 queueing systems. The general se...
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G...
AbstractKeane, Hooghiemstra and Van de Ree have proposed a new numerical method for calculating stat...
This article derives amazingly accurate approximations to the state probabilities and waiting-time p...
This article shows that very accurate accurate approximations to performance measures in the multise...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
A single-server queueing system with negative customers is considered in this paper. One positive c...
This article deals with Bayesian inference and prediction for M/G/1 queueing systems. The general se...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Consideration is given to queueing system with Poisson flows of ordinary and negative customers. O...
AbstractThe M/G/2 queueing model with service time distribution a mixture of m negative exponential ...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
In many applications, significant correlations between arrivals of load-generating events make the n...
This article deals with Bayesian inference and prediction for M/G/1 queueing systems. The general se...
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
In this paper we study the sample paths during a busy period of a Finite MEP/MEP/1 system, where bot...
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G...
AbstractKeane, Hooghiemstra and Van de Ree have proposed a new numerical method for calculating stat...