Analyzing an infinite buffer batch arrival and batch service queue under batch-size-dependent service policy

被引:9
作者
Pradhan, S. [1 ]
Gupta, U. C. [1 ]
Samanta, S. K. [2 ]
机构
[1] Indian Inst Technol, Dept Math, Kharagpur 721302, W Bengal, India
[2] Natl Inst Technol, Dept Math, Raipur 492010, Madhya Pradesh, India
关键词
Batch-arrival; Batch-service; Batch-size-dependent service; Multiple roots; Queueing; Random capacity; MODEL; PROBABILITIES; TIMES;
D O I
10.1016/j.jkss.2015.08.004
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
In this paper, we investigate an infinite-buffer queue with batch-arrival and batch-service wherein a single server operates under random serving capacity rule with service time dependent on the size of the batch under the service. First, we derive the probability generating function of state probabilities at service completion epoch, from which an entire spectrum regarding queue-length at various epochs is extracted. Using the departure epoch probabilities, we establish a stable relationship between departure and random epochs probabilities based on 'rate in = rate out' approach. Further, random epoch probabilities are used to obtain pre-arrival epoch probabilities. Finally, we illustrate our analytical results by means of numerical computation which includes the case of multiple roots. (C) 2015 The Korean Statistical Society. Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:137 / 148
页数:12
相关论文
共 12 条
  • [1] Abolnikov L, 2003, J APPL MATH STOCH AN, V16, P361, DOI DOI 10.1155/S1048953303000285
  • [2] Banerjee A., 2013, International Journal of Mathematics in Operational Research, V5, P358
  • [3] Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service
    Banerjee, A.
    Gupta, U. C.
    [J]. PERFORMANCE EVALUATION, 2012, 69 (01) : 53 - 70
  • [4] Applications of bulk queues to group testing models with incomplete identification
    Bar-Lev, Shaul K.
    Parlar, Mahmut
    Perry, David
    Stadje, Wolfgang
    Schouten, Frank A. Van der Duyn
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 183 (01) : 226 - 237
  • [5] Modeling and performance analysis of a finite-buffer queue with batch arrivals, batch services, and setup times:: The MX/GY/1/K+B queue with setup times
    Chang, Seok Ho
    Choi, Dae Won
    [J]. INFORMS JOURNAL ON COMPUTING, 2006, 18 (02) : 218 - 228
  • [6] A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B+b) Queues Using Roots
    Chaudhry, M. L.
    Gai, Jing
    [J]. INFOR, 2012, 50 (02) : 72 - 79
  • [7] Tail probabilities of the delay in a batch-service queueing model with batch-size dependent service times and a timer mechanism
    Claeys, Dieter
    Steyaert, Bart
    Walraevens, Joris
    Laevens, Koenraad
    Bruneel, Herwig
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1497 - 1505
  • [8] Analysis of a versatile batch-service queueing model with correlation in the arrival process
    Claeys, Dieter
    Steyaert, Bart
    Walraevens, Joris
    Laevens, Koenraad
    Bruneel, Herwig
    [J]. PERFORMANCE EVALUATION, 2013, 70 (04) : 300 - 316
  • [9] A queueing model for general group screening policies and dynamic item arrivals
    Claeys, Dieter
    Walraevens, Joris
    Laevens, Koenraad
    Bruneel, Herwig
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (02) : 827 - 835
  • [10] Analysis of finite-buffer state-dependent bulk queues
    Germs, Remco
    van Foreest, Nicky
    [J]. OR SPECTRUM, 2013, 35 (03) : 563 - 583