Page 1 Next

Displaying 1 – 20 of 21

Showing per page

Cálculo del número medio de máquinas activas en un grupo de un operario y N máquinas, con incidencias poissonianas y tiempos de servicio aleatorio.

Albert Corominas Subias (1988)

Qüestiió

Este artículo expone un método para el cálculo del número medio de máquinas en funcionamiento en un sistema formado por un operario y N máquinas iguales, con tiempos exponenciales de funcionamiento entre averías y tiempos de servicio aleatorios, idéntica e independientemente distribuidos. El modelo generaliza las conocidas fórmulas que se obtienen a partir de los modelos M/M/1 con centro emisor finito y de Ashcroft, que suelen utilizarse para el problema de asignación de máquinas.

Characterization of the departure process from an ME/ME/1 queue

Jayesh Kumaran, Kenneth Mitchell, Appie Van de Liefvoort (2004)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag ( k - 1 ) .

Characterization of the departure process from an ME/ME/1 queue

Jayesh Kumaran, Kenneth Mitchell, Appie van de Liefvoort (2010)

RAIRO - Operations Research

In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag (k - 1).

Computation of the limiting distribution in queueing systems with repeated attempts and disasters

J. R. Artalejo, A. Gómez-Corral (2010)

RAIRO - Operations Research

Single server queues with repeated attempts are useful in the modeling of computer and telecommunication systems. In addition, we consider in this paper the possibility of disasters. When a disaster occurs, all the customers present in the system are destroyed immediately. Using a regenerative approach, we derive a numerically stable recursion scheme for the state probabilities. This model can be employed to analyze the behaviour of a buffer in computers with virus infections.

Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv, Rita Zlotnikov (2011)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...

Computational schemes for two exponential servers where the first has a finite buffer

Moshe Haviv, Rita Zlotnikov (2011)

RAIRO - Operations Research

We consider a system consisting of two not necessarily identical exponential servers having a common Poisson arrival process. Upon arrival, customers inspect the first queue and join it if it is shorter than some threshold n. Otherwise, they join the second queue. This model was dealt with, among others, by Altman et al. [Stochastic Models20 (2004) 149–172]. We first derive an explicit expression for the Laplace-Stieltjes transform of the distribution underlying the arrival (renewal) process to...

Contrôle dynamique de flux dans un système d'attente avec panne

A. Haqiq, N. Mikou (2010)

RAIRO - Operations Research

We consider two parallel M/M/1 queues. The server at one of the queues is subject to intermittent breakdowns. By the theory of dynamic programming, we determine a threshold optimal policy which consists to transfer, when it is necessary, the customers that arrive at the first queue towards the second queue in order to minimize an instantaneous cost depending of the two queue lengths.

Currently displaying 1 – 20 of 21

Page 1 Next