In this note we present algorithms that compute, exactly or approximately, time-dependent waiting time tail probabilities and the time-dependent expected waiting time in M(t)/M/s(t) queuing systems.nonstationary, time dependent, multiserver queues, waiting time
We consider a model describing the waiting time of a server alternating between two ser-vice points....
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Abstract | This letter proposes a simple exponential ap-proximation for waiting time tail probabilit...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
We consider a multiserver service system with general nonstationary arrival and service-time process...
The paper presents a detailed study of a computer processing queueing system which has a binomial in...
Revised October 1994This paper examines the time lag between the peak in the arrival rate and the pe...
AbstractIn this paper, a discrete-time multiserver queueing system with infinite buffer size is stud...
This paper published in "Tijdschrift voor Economie en Management" 36 (1991), 311-34
Discrete time queueing models have been shown previously to be of practical use for modelling the ap...
We calculate the expected lateness for a late job in an M/M/1/K queue (i.e., the expected waiting ti...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
We consider a model describing the waiting time of a server alternating between two ser-vice points....
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
In this note we present algorithms that compute, exactly or approximately, time dependent waiting ti...
Abstract | This letter proposes a simple exponential ap-proximation for waiting time tail probabilit...
Queueing theory focuses on study waiting lines though the use of mathematical or queueing models. Q...
We consider a multiserver service system with general nonstationary arrival and service-time process...
The paper presents a detailed study of a computer processing queueing system which has a binomial in...
Revised October 1994This paper examines the time lag between the peak in the arrival rate and the pe...
AbstractIn this paper, a discrete-time multiserver queueing system with infinite buffer size is stud...
This paper published in "Tijdschrift voor Economie en Management" 36 (1991), 311-34
Discrete time queueing models have been shown previously to be of practical use for modelling the ap...
We calculate the expected lateness for a late job in an M/M/1/K queue (i.e., the expected waiting ti...
We study waiting time problems for first-order Markov dependent trials via conditional probability g...
Waiting time problems, discrete distributions of order k , Markov chain, Markov chain imbedding meth...
We consider a model describing the waiting time of a server alternating between two ser-vice points....
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
For a simple queue with finite waiting space the difference equations satisfied by the Laplace trans...
DOI
Add to ORKG