Analysis of single server finite queueing model with reneging Online publication date: Wed, 06-Jul-2016
by Charan Jeet Singh; Madhu Jain; Binay Kumar
International Journal of Mathematics in Operational Research (IJMOR), Vol. 9, No. 1, 2016
Abstract: The present investigation deals with the analysis of Markovian queueing model with finite capacity and finite population wherein the server works in fast and slow random environments, depending on the status of service system, with exponential distributed time parameters. On arrival of the customer in slow mode, the exponential distributed time may be fixed. Due to the impatient behaviour (reneging), the customer may leave the queue after some time of joining the system if the server does not change its state before expiry of the timer. To discuss the behaviour of the queue length distribution and to obtain the transient solution, Runge-Kutta method of the fourth order is used. Various performance measures are determined in terms of transient probabilities of the system states. The numerical illustrations are facilitated to validate the tractability of performance measures as far as computational aspect is concerned.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook