Displaying similar documents to “On a discrete modified M / G I / c / ∞ queue”

Joint distribution of the busy and idle periods of a discrete modified G I / G I / c / ∞ queue

Anatolij Dvurečenskij (1988)

Aplikace matematiky

Similarity:

For a discrete modified G I / G I / c / ∞ queue, 1 ≤ c < ∞ , where the service times of all customers served during any busy period are independent random variables with not necessarily identical distribution functions, the joint distribution of the busy period, the subsequent idle period and the number of customers served during the busy period is derived. The formulae presented are in a convenient form for practical use. The paper is a continuation of [5], where the M / G I / c / ∞ discrete modified queue has been studied. ...

Analyzing discrete-time bulk-service queue

Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)

RAIRO - Operations Research

Similarity:

This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...

A discrete-time queueing system with changes in the vacation times

Ivan Atencia (2016)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability...

An M/G/1 queueing system with compulsory server vacations.

Kilash C. Madan (1992)

Trabajos de Investigación Operativa

Similarity:

This paper deals with a single server queue with compulsory server vacations. There are single Poisson arrivals with mean arrival date λ and the service is performed in batches of fixed size M (≥1) or min (n, M) and the service times of successive batches follow a general distribution with the density function D(x). The Laplace transforms of the probability generating functions of different states of the system have been obtained, the corresponding steady state results have been derived...