A paradox in a queueing network with state-dependent routing and loss.
Ziedins, Ilze (2007)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Ziedins, Ilze (2007)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Moretta, Brian, Ziedins, Ilze (1998)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Jau-Chuan Ke (2004)
The Yugoslav Journal of Operations Research
Similarity:
Dudin, Alexander N., Nishimura, Shoichi (1999)
Mathematical Problems in Engineering
Similarity:
Olga V. Semenova (2010)
RAIRO - Operations Research
Similarity:
A single-server queueing system with a batch Markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.
Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Olga V. Semenova (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A single-server queueing system with a batch markovian arrival process (BMAP) and MAP-input of disasters causing all customers to leave the system instantaneously is considered. The system has two operation modes, which depend on the current queue length. The embedded and arbitrary time stationary queue length distribution has been derived and the optimal control threshold strategy has been determined.
K. Bidhi Singh (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Rakesh Kumar Verma (1982)
Kybernetika
Similarity:
Jesús R. Artalejo (1992)
Trabajos de Investigación Operativa
Similarity:
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...