jaem TWMS Journal of Applied and Engineering Mathematics 2146-1147 2587-1013 Işık University Press OPTIMIZATION OF RENEWAL INPUT a, c, b POLICY WORKING VACATION QUEUE WITH CHANGE OVER TIME AND BERNOULLI SCHEDULE VACATION INTERRUPTION Laxmi P. Vijaya Department of Applied Mathematics, Andhra University, Visakhapatnam 530 003, India. Goswami V. School of Computer Application, KIIT University, Bhubaneswar 751024, India. Seleshil D. Department of Applied Mathematics, Andhra University, Visakhapatnam 530 003, India. 12 01 2014 4 2 131 146 Copyright © 2010, TWMS Journal of Applied and Engineering Mathematics 2010 TWMS Journal of Applied and Engineering Mathematics

This paper presents a renewal input single working vacation queue with change over time and Bernoulli schedule vacation interruption under a, c, b policy. The service and vacation times are exponentially distributed. The server begins service if there are at least c units in the queue and the service takes place in batches with a minimum of size a and a maximum of size b a ≤ c ≤ b . The change over period follows if there are a − 1 customers at service completion instants. The steady state queue length distributions at arbitrary and pre-arrival epochs are obtained. An optimal cost policy is presented along with few numerical experiences. The genetic algorithm and quadratic fit search method are employed to search for optimal values of some important parameters of the system.

 Single working vacation vacation interruption cost queue genetic algorithm Servi, L. D. and Finn, S. G. (2002), M/M/1 queues with working vacations (M/M/1/W V ), Perf. Eval., 50, 41-52. Baba, Y. (2005), Analysis of a GI/M/1 queue with multiple working vacations, Oper. Res. Lett., 33, 209. Chae, K. C., Lim, D. E. and Yang, W. S. (2009), The GI/M/1 queue and the GI/Geo/1 queue both with single working vacation, Perf. Eval., 66, 356-367. Li, J. and Tian, N. (2011), Performance analysis of a GI/M/1 queue with single working vacation, Appl. Math. Comput., 217, 4960-4971. Banik, A., Gupta, U. C. and Pathak, S. (2007), On the GI/M/1/N queue with multiple working vacations - Analytic analysis and computation, Appl. Math. Model., 31, 1701-1710. Goswami, V. and Mund, G. B. (2011), Analysis of discrete-time batch service renewal input queue with multiple working vacations, Comp. Indus. Engg., 61, 629-636. Jain, M., and Singh, P. (2005), State dependent bulk service queue with delayed vacations, JKAU Engg. Sci., 16, 3-15. Li, J., Tian, N. and Liu, W. (2007), Discrete time GI/Geo/1 queue with multiple working vacations, Queueing Systems, 56, 53-63. Tian, N. and Zhang, Z. G. (2006), Vacation Queueing Models: Theory and Applications, Springer, NewYork. Li, J. and Tian, N. (2007), The M/M/1 queue with working vacations and vacation interruption, J. Sys. Sci. Sys. Engg., 16, 121-127. Li, J., Tian, N. and Ma, Z. (2008), Performance analysis of GI/M/1 queue with working vacations and vacation interruption, Appl. Math. Model., 32, 2715-2730. Zhao, G., Du, X. and Tian, N. (2009), GI/M/1 queue with set-up period and working vacation and vacation interruption, Int. J. Infor. Manage. Sci., 20, 351-363. Jain, M., Sharma, G. C., and Sharma, R. (2011), Working vacation queue with service interruption and multi optional repair, Int. J. Infor. Manage. Sci., 22, 157-175. Zhang, M. and Hou, Z. (2011), Performance analysis of M AP/G/1 queue with working vacations and vacation interruption, Appl. Math. Model., 35, 1551-1560. Zhang, H. and Shi, D. (2009), The M/M/1 queue with Bernoulli-schedule-controlled vacation and vacation interruption, Int. J. Infor. Manage. Sci., 20, 579-587. Li, T., Zhang, L. and Xu, X. (2012), The GI/Geo/1 queue with start-up period and single working vacation and Bernoulli vacation interruption, J. Infor. & Comput. Sci., 9, 2659-2673. Gao, S. and Liu, Z. (2013), An M/G/1 queue with single working vacation and vacation interruption under Bernoulli schedule, Appl. Math. Model., 37, 1564-1579. Tadj, L., Choudhury, G. and Tadj, C. (2006), A bulk quorum queueing system with a random setup time under N - policy and with Bernoulli vacation schedule, Int. J. Prob. Stoch. Pro., 78, 1-11. Baburaj, C. and Surendranath, T. M. (2005), An M/M/1 bulk service queue under the policy (a, c, d) Int. J. Agri. Stat. Sci., 1, 27-33. Baburaj, C. (2010), A discrete time (a, c, d) policy bulk service queue, Int. J. Infor. Manage. Sci., 21, 480. Haupt, R. L. and Haupt, S. E. (2004), Practical Genetic Algorithms, John Wiley and Sons, Inc. Hoboken, New Jersey, Canada. Lin, C. H. and Ke, J. C. (2010), Genetic algorithm for optimal thresholds of an infinite capacity multi-server system with triadic policy, Expert Sys. Appl., 37, 4276-4282. Lin, C. H. and Ke, J. C. (2011), Optimization analysis for an infinite capacity queueing system with multiple queue-dependent servers: genetic algorithm, Int. J. Comp. Math., 88, 1430-1442. Rao, S. S. (2009), Engineering Optimization: Theory and Practice, John Wiley & Sons, New Jersey. Rardin, R. L. (1997), Optimization in Operations Research, Prentice Hall, New Jersey.