All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 383

Showing per page

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.

Entropy maximization and the busy period of some single-server vacation models

Jesus R. Artalejo, Maria J. Lopez-Herrero (2004)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, information theoretic methodology for system modeling is applied to investigate the probability density function of the busy period in M / G / 1 vacation models operating under the N -, T - and D -policies. The information about the density function is limited to a few mean value constraints (usually the first moments). By using the maximum entropy methodology one obtains the least biased probability density function satisfying the system’s constraints. The analysis of the three controllable...

Entropy maximization and the busy period of some single-server vacation models

Jesus R. Artalejo, Maria J. Lopez-Herrero (2010)

RAIRO - Operations Research

In this paper, information theoretic methodology for system modeling is applied to investigate the probability density function of the busy period in M/G/1 vacation models operating under the N-, T- and D-policies. The information about the density function is limited to a few mean value constraints (usually the first moments). By using the maximum entropy methodology one obtains the least biased probability density function satisfying the system's constraints. The analysis of the three controllable...

Currently displaying 101 – 120 of 383