Effective utilization of idle time in an inventory with positive service time.
Krishnamoorthy, A., Deepak, T.G., Narayanan, Viswanath C., Vineetha, K. (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Krishnamoorthy, A., Deepak, T.G., Narayanan, Viswanath C., Vineetha, K. (2006)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Dudin, Alexander N., Chakravarthy, Srinivas R. (2003)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Haridass, M., Arumuganathan, R. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
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...
K. Bidhi Singh (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Tadj, Lotfi (2000)
Mathematical Problems in Engineering
Similarity:
Tang, Liang, Xi, Hong-Sheng, Zhu, Jin, Yin, Bao-Qun (2010)
Mathematical Problems in Engineering
Similarity:
Babitsky, Alexander V. (1997)
Mathematical Problems in Engineering
Similarity:
Muh, David C.R. (1993)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Andrzej Chydziński, Łukasz Chróst (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical...
S. K. Matendo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: