This paper analyzes a finite buffer multiple working vacations queue with balking, reneging, and vacation interruption under -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 least customers 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. 1. Introduction Performance modeling of queueing systems with balking and reneging has attracted many researchers owing to their wide applications in real life congestion problems such as impatient telephone switchboard customers, hospital emergency rooms handling critical patients and perishable goods storage in inventory systems. Balking and reneging are a common phenomena in queues; as a consequence, the customers either decide not to join the queue or depart after joining the queue without getting service due to impatience. Modeling balking and reneging is worthwhile because one obtains new managerial insights. The lost revenues due to balking and reneging in various industries can be enormous. While making decision for the number of servers needed in the service system to meet time-varying demand, the balking and reneging probabilities can be used to estimate the amount of lost business in more practical consideration for the managers as given in Liao [1]. Impatience is the most prominent characteristic as individuals always feel anxious and impatient during waiting for service in real life. The customer's impatient acts should be involved in the study of queueing system to model real situations exactly. Intermittent operation of a service can be economically appealing whenever full time service would result in significant server idle time or would preclude the use of the server in some other productive capacity. On the other hand, having the server inoperative for periods of time may increase the probability of customer losses due to balking and reneging. An queue with customers balking and reneging has been discussed in Haight [2] and Haight [3], respectively. The combined impact of balking and reneging with finite capacity in an queue has
References
[1]
P. Liao, “Optimal staffing policy for queueing systems with cyclic demands: waiting cost approach,” in Proceedings of the 18th Annual Conference of the Production and Operations Management Society (POMS '07), Dallas, Tex, USA, 2007.
[2]
F. A. Haight, “Queueing with balking,” Biometrika, vol. 44, pp. 360–369, 1957.
[3]
F. A. Haight, “Queueing with reneging,” Metrika, vol. 2, no. 1, pp. 186–197, 1959.
[4]
C. J. Ancker Jr. and A. V. Gafarian, “Some queueing problems with balking and reneging: I,” Operations Research, vol. 11, no. 1, pp. 88–100, 1963.
[5]
C. J. Ancker Jr. and A. V. Gafarian, “Some queueing problems with balking and reneging: II,” Operations Research, vol. 11, no. 6, pp. 928–937, 1963.
[6]
M. O. Abou-El-Ata, “The state-dependent queue: M/M/1/N with reneging and general balk functions,” Microelectronics Reliability, vol. 31, no. 5, pp. 1001–1007, 1991.
[7]
M. O. Abou-El-Ata and A. I. Shawky, “The single-server Markovian overflow queue with balking, reneging and an additional server for longer queues,” Microelectronics Reliability, vol. 32, no. 10, pp. 1389–1394, 1992.
[8]
H. W. Chia and K. Jau-Chaun, “Computational algorithm and parameter optimization for a multi-server system with unreliable servers and impatient customers,” Journal of Computational and Applied Mathematics, vol. 235, no. 3, pp. 547–562, 2010.
[9]
A. Choudhury and P. Medhi, “Some aspects of balking and reneging in finite buffer queues,” RAIRO-Operations Research, vol. 45, no. 3, pp. 223–240, 2011.
[10]
K. Rakesh and K. S. Sumeet, “An M/M/1/N queueing model with retention of reneged customers and balking,” American Journal of Operational Research, vol. 2, no. 1, pp. 1–5, 2012.
[11]
N. Tian and Z. G. Zhang, Vacation Queueing Models: Theory and Applications, Springer, New York, NY, USA, 2006.
[12]
J. C. Ke, C. H. Wu, and Z. G. Zhang, “Recent developments in vacation queueing models: a short survey,” International Journal of Operations Research, vol. 7, pp. 3–8, 2010.
[13]
D. Yue, Y. Zhang, and W. Yue, “Optimal performance analysis of an M/M/1/N queue system with balking, reneging and server vacation,” International Journal of Pure and Applied Mathematics, vol. 28, pp. 101–115, 2006.
[14]
S. Vikas and P. Deepali, “Performance analysis of state dependent bulk service queue with balking, reneging and server vacation,” International Journal of Operational Research Nepal, vol. 1, pp. 61–69, 2012.
[15]
L. D. Servi and S. G. Finn, “M/M/1 queues with working vacations (M/M/1/WV),” Performance Evaluation, vol. 50, no. 1, pp. 41–52, 2002.
[16]
P. Vijaya Laxmi, V. Goswami, and K. Jyothsna, “Analysis of finite buffer Markovian queue with balking, reneging and working vacations,” International Journal of Strategic Decision Sciences, vol. 4, no. 1, pp. 1–24, 2013.
[17]
J. Li and N. Tian, “The M/M/1 queue with working vacations and vacation interruptions,” Journal of Systems Science and Systems Engineering, vol. 16, no. 1, pp. 121–127, 2007.
[18]
Y. Baba, “The M/PH/1 queue with working vacations and vacation interruption,” Journal of Systems Science and Systems Engineering, vol. 19, no. 4, pp. 496–503, 2010.
[19]
M. Zhang and Z. Hou, “Performance analysis of M/G/1 queue with working vacations and vacation interruption,” Journal of Computational and Applied Mathematics, vol. 234, no. 10, pp. 2977–2985, 2010.
[20]
Z. Zhang and X. Xu, “Analysis for the M/M/1 queue with multiple working vacations and N-policy,” International Journal of Information and Management Sciences, vol. 19, no. 3, pp. 495–506, 2008.
[21]
J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Canberra, Australia, December 1995.
[22]
Y. Shi and R. C. Eberhart, “Parameter selection in particle swarm optimization,” in Proceedings of the 7th Annual Conference on Evolutionary Programming, pp. 591–600, Springer, 1998.
[23]
B. Qinghai, “Analysis of particle swarm optimization algorithm,” Computer and Information Science, vol. 3, pp. 180–184, 2010.
[24]
S. S. Rao, Engineering Optimization: Theory and Practice, John Wiley & Sons, Hoboken, NJ, USA, 2009.
[25]
R. L. Rardin, Optimization in Operations Research, Prentice Hall, Upper Saddle River, NJ, USA, 1997.