Analysis of finite buffer renewal input queue with balking and multiple working vacations

OPSEARCH ◽  
2013 ◽  
Vol 50 (4) ◽  
pp. 548-565 ◽  
Author(s):  
P. Vijaya Laxmi ◽  
K. Jyothsna
2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
P. Vijaya Laxmi ◽  
V. Goswami ◽  
K. Jyothsna

This paper analyzes a finite buffer multiple working vacations queue with balking, reneging, and vacation interruption underN-policy. In the working vacation, a customer is served at a lower rate and at the instants of a service completion; if there are at leastNcustomers in the queue, the vacation is interrupted and the server switches to regular busy period otherwise continues the vacation. Using Markov process and recursive technique, we derive the stationary system length distributions at arbitrary epoch. Various performance measures and some special models of the system are presented. Cost analysis is carried out using particle swarm optimization and quadratic fit search method. Finally, some numerical results showing the effect of model parameters on key performance measures of the system are presented.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Veena Goswami

This paper presents an analysis of balking and reneging in finite-buffer discrete-time single server queue with single and multiple working vacations. An arriving customer may balk with a probability or renege after joining according to a geometric distribution. The server works with different service rates rather than completely stopping the service during a vacation period. The service times during a busy period, vacation period, and vacation times are assumed to be geometrically distributed. We find the explicit expressions for the stationary state probabilities. Various system performance measures and a cost model to determine the optimal service rates are presented. Moreover, some queueing models presented in the literature are derived as special cases of our model. Finally, the influence of various parameters on the performance characteristics is shown numerically.


2014 ◽  
Vol 24 (1) ◽  
pp. 127-143 ◽  
Author(s):  
Jiang Cheng ◽  
Yinghui Tang ◽  
Miaomiao Yu

This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD), it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed. The server does not take a vacation immediately at service complete epoch but keeps idle period. According to a bulk-service rule, at least one customer is needed to start a service with a maximum serving capacity 'a'. Using probability analysis method and displacement operator method, the queue length and the probability generating function of waiting time at pre-arrival epochs are obtained. Furthermore, the outside observer?s observation epoch queue length distributions are given. Finally, computational examples with numerical results in the form of graphs and tables are discussed.


2018 ◽  
Vol 7 (4.10) ◽  
pp. 758
Author(s):  
P. Rajadurai ◽  
R. Santhoshi ◽  
G. Pavithra ◽  
S. Usharani ◽  
S. B. Shylaja

A multi phase retrial queue with optional re-service and multiple working vacations is considered. The Probability Generating Function (PGF) of number of customers in the system is obtained by supplementary variable technique. Various system performance measures are discussed. 


2020 ◽  
Vol 33 (4) ◽  
pp. 1144-1162
Author(s):  
Zhanyou Ma ◽  
Li Chen ◽  
Pengcheng Wang

Sign in / Sign up

Export Citation Format

Share Document