A renewal input single and batch service queues with accessibility to batches

被引:5
|
作者
Goswami, V. [1 ]
Laxmi, P. Vijaya [2 ]
机构
[1] KIIT Univ, Sch Comp Applicat, Bhubaneswar 751024, Orissa, India
[2] Andhra Univ, Dept Appl Math, Visakhapatnam 530003, Andhra Pradesh, India
关键词
queue; single service; batch service; accessible batch; non-accessible batch;
D O I
10.1080/17509653.2011.10671185
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents a renewal input single and batch service infinite (finite) buffer queueing system with accessibility to the batches. The inter-arrival times of successive arrivals are assumed to be independent and arbitrarily distributed. The customers are served by a single-server either one at a time or in batches with accessibility to the batches depending upon the number of customers present in the system. The service times are assumed to be independent and exponentially distributed. We present a recursive method, using the supplementary variable technique and treating the supplementary variable as the remaining inter-arrival time, to obtain the steady-state probability distribution of the number of customers in the system/queue. A cost model is developed to determine the optimum service rates which minimizes the total expected cost for assumed numerical values of system parameters. Various performance measures are provided based on this analysis.
引用
收藏
页码:366 / 373
页数:8
相关论文
共 50 条