Queueing system M/MX(R)/ infinity

被引：0
|
作者：
Ushakumari, P.V.
Krishnamoorthy, A.
机构：
来源：
Asia-Pacific Journal of Operational Research | 1998年 / 15卷 / 01期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：17 / 28
相关论文
共 50 条
  • [31] Optimization of an M/M/∞ Queueing System with Free Experience Service
    Shi, Ying
    Li, Xin
    Fan, Ping
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2016, 33 (06)
  • [32] Optimization of a generalized M(k)/M/k queueing system
    Yang, T
    Hu, QY
    Yue, WY
    SERVICE SYSTEMS AND SERVICE MANAGEMENT - PROCEEDINGS OF ICSSSM '04, VOLS 1 AND 2, 2004, : 821 - 826
  • [33] OUTPUT PROCESS OF A STATIONARY M/M/S QUEUEING SYSTEM
    BURKE, PJ
    ANNALS OF MATHEMATICAL STATISTICS, 1968, 39 (04): : 1144 - &
  • [34] An M/M/C retrial queueing system with Bernoulli vacations
    B. Krishna Kumar
    R. Rukmani
    V. Thangaraj
    Journal of Systems Science and Systems Engineering, 2009, 18
  • [35] Study of the M/M/1 retrial queueing system with disasters
    Meloshnikova, Natalya P.
    Nazarov, Anatoly A.
    Fedorova, Ekaterina A.
    VESTNIK TOMSKOGO GOSUDARSTVENNOGO UNIVERSITETA-UPRAVLENIE VYCHISLITELNAJA TEHNIKA I INFORMATIKA-TOMSK STATE UNIVERSITY JOURNAL OF CONTROL AND COMPUTER SCIENCE, 2024, (68):
  • [36] On The Transient Departure Process of Mx/G/1 Queueing System with Single Server Vacation
    Yinghui Tang
    Journal of Systems Science and Complexity, 2007, 20 : 562 - 571
  • [37] An M/M/C retrial queueing system with Bernoulli vacations
    Kumar, B. Krishna
    Rukmani, R.
    Thangaraj, V.
    JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2009, 18 (02) : 222 - 242
  • [38] Cost analysis of a two — phase MX/EK/1 queueing system with N — policy
    V. Vasanta Kumar
    K. Chandan
    OPSEARCH, 2008, 45 (2) : 155 - 174
  • [39] Continuity theorems for the M/M/1/n queueing system
    Vyacheslav M. Abramov
    Queueing Systems, 2008, 59 : 63 - 86
  • [40] Continuity theorems for the M/M/1/n queueing system
    Abramov, Vyacheslav M.
    QUEUEING SYSTEMS, 2008, 59 (01) : 63 - 86
12345