A queueing system with random additional service facility
K. Bidhi Singh (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
K. Bidhi Singh (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Krishnamoorthy, A., Deepak, T.G., Narayanan, Viswanath C., Vineetha, K. (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Jau-Chuan Ke, Kuo-Hsiung Wang (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we consider a like-queue production system in which server startup and breakdowns are possible. The server is turned on (i.e. begins startup) when units are accumulated in the system and off when the system is empty. We model this system by an M/M/1 queue with server breakdowns and startup time under the policy. The arrival rate varies according to the server’s status: off, startup, busy, or breakdown. While the server is working, he is subject to breakdowns according...
Ernest Koenigsberg (1985)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jau-Chuan Ke (2004)
The Yugoslav Journal of Operations Research
Similarity:
R. L. Garg, S. K. Khanna (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
George P. Cosmetatos, Gregory P. Prastacos (1985)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
S. K. Matendo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Haridass, M., Arumuganathan, R. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Ziedins, Ilze (2007)
Journal of Applied Mathematics and Decision Sciences
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...