We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t)+G(t) queue with exhaustive discipline and abandonments. The performance measures of interest are: (1) the average number of customers in queue, (2) the variance of the number of customers in queue, (3) the average number of abandonments and (4) the virtual waiting time distribution of a customer when arriving at an arbitrary moment in time. We use acyclic phase-type distributions to approximate the general interarrival, service and abandonment time distributions. An efficient, iterative algorithm allows the accurate analysis of small- to medium-sized problem instances. The validity and accuracy of the model are assessed using a simulation study.nrpages: 29...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t)+G(t) queue with...
Abstract- We present a Markov model to analyze the queue-ing behavior of the nonstationary G(t)/G(t)...
We present a Markov model to analyze the queueing behavior of the nonstationary G(t)/G(t)/s(t)+G(t) ...
We present a Markov model to analyze the queueing behavior of the nonstationary G(t)/G(t)/s(t)+G(t) ...
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
An algorithm is developed to rapidly compute approximations for all the standard steady-state perfor...
This paper contains additional material supplementing the main paper to be published in Management S...
We study a variation of the M/G/1 queueing model in which service time of customers is modified depe...
We present a historical and theoretical overview of the more complicated and less used G/M and M/G q...
Recent studies indicate that in many situations service times are affected by the experienced queuei...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t)+G(t) queue with...
Abstract- We present a Markov model to analyze the queue-ing behavior of the nonstationary G(t)/G(t)...
We present a Markov model to analyze the queueing behavior of the nonstationary G(t)/G(t)/s(t)+G(t) ...
We present a Markov model to analyze the queueing behavior of the nonstationary G(t)/G(t)/s(t)+G(t) ...
The M(t)/G/s(t)+G queue (with a time-varying arrival rate and general distributions for the service ...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
The M(t)=G=s(t) + G queue (with a timevarying arrival rate and general distributions for the service...
An algorithm is developed to rapidly compute approximations for all the standard steady-state perfor...
This paper contains additional material supplementing the main paper to be published in Management S...
We study a variation of the M/G/1 queueing model in which service time of customers is modified depe...
We present a historical and theoretical overview of the more complicated and less used G/M and M/G q...
Recent studies indicate that in many situations service times are affected by the experienced queuei...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...
International audienceClassical performance evaluation of sharing resources systems using queues is ...