We study the impact of service time distributions on the distribution ofthe maximum queue length during a busy period for the Mx/G/1 queue. The maximum queue length is an important random variable to understand when designing the buffer size for finite-buffer (M/G/1/n) systems. We show the somewhat surprising result that, for three variations of the preemptive last-come-first-served discipline,...

In this paper ,we discuss the Geom/G/1 queue with Bernoulli feedback and server setup/closedown times.We derive the probability generating function (PGF) of the steady-state queue length immediately after a service completion by the embedded Markov chain and the PGF of the queue length immediately after an arbitrary slot boundary .We also get the PGF of the stationary waiting times under first ...

Information about queue length is an important parameter for customers who face the decision whether to join a queue or not. In this paper, we study how optimal information disclosure policies can be used by a service provider of an M/M/1 queue to increase its revenue. Our main contribution is showing that the intuitive policy of informing customers about the current queue length when it is sho...

This paper deals with the study of multi-server queueing model in a fuzzy environment imposition reneging customers. Entry customers system is assumed to be Poisson process and exponential service time distribution under first-come-first-served basis. Specific this investigation derive various performance measures such as queue length, waiting queue, response optimal number servers explicit for...

This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue length distribution in a FIFO queue with multiple non-Poissonian arrival streams having different...

We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...

conclusions: the patients' waiting times and the number of patients waiting to receive services in both shifts could be reduced by using multitasking persons and reallocating them to the time-consuming stage of filling prescriptions, using queuing theory and simulation techniques. background: hospital pharmacy is responsible for controlling and monitoring the medication use process and ensures ...

In this paper, we consider the steady-state queue length distribution of the GI/G/1/K queue. As a result, we obtain transform-free expressions for the steady-state queue length distributions at an arrival, at a departure and at an arbitrary time, all in product forms. The results are obtained by what we call the decomposed Little’s formula, which applies the Little’s formula W L λ = to the n wa...