A transportation system viewed as a queueing system
This article deals with the three classic policies for an M/G/1 queueing system (N, T, and D-policy). The optimum policies were compared in several precedent studies, but the comparison was performed employing different cost functions, so that the D-policy is superior to the N-policy when the cost function is based on the mean work-load, whilst the average queue length is used to show the superiority of the N-policy over the T-policy. In order to achieve a comparison of the three policies under...
En este artículo se describen algunos de los modelos markovianos de redes de colas más interesantes, como los de Jackson, Gordon y Newell, Reiser y Kobayashi y otros, estudiando las relaciones existentes entre ellos. Se demuestra que la solución conocida como "forma de producto" es válida para todos ellos con las modificaciones apropiadas en cada caso.
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 and in a...
This paper describes an unreliable server batch arrival retrial queue with two types of repair and second optional service. The server provides preliminary first essential service (FES) to the primary arriving customers or customers from retrial group. On successful completion of FES, the customer may opt for second optional service (SOS) with probability α. The server is subject to active break downs. The customer under FES (or SOS) during the failure decides, with probability q, to join the orbit(impatientcustomer)...
We address a queueing control problem considering service times and conversion times following normal distributions. We formulate the multi-server queueing control problem by constructing a semi-Markov decision process (SMDP) model. The mechanism of state transitions is developed through mathematical derivation of the transition probabilities and transition times. We also study the property of the queueing control system and show that optimizing the objective function of the addressed queueing control...
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered....