An M/M/1 queue with working vacation and vacation interruption under Bernoulli schedule

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

This work deals with M/M/1 queue with Vacation and Vacation Interruption Under Bernoulli schedule. When there are no customers in the system, the server takes a classical vacation with probability p or a working vacation with probability 1-p, where 0 ≤ p ≤ 1. At the instants of service completion during the working vacation, either the server is supposed to interrupt the vacation and returns back to the non-vacation period with probability 1-q or the sever will carry on with the vacation with probability q. When the system is non empty after the end of vacation period, a new non vacation period begins. A matrix geometric approach is employed to obtain the stationary distribution for the mean queue length and the mean waiting time and their stochastic decomposition structures. Numerous graphical demonstrations are presented to show the effects of the system parameters on the performance measures.

Cite

CITATION STYLE

APA

Manoharan, P., & Ashok, A. (2018). An M/M/1 queue with working vacation and vacation interruption under Bernoulli schedule. International Journal of Engineering and Technology(UAE), 7(4.10 Special Issue  10), 448–454. https://doi.org/10.14419/ijet.v7i4.10.21038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free