A repairable M[X]/Gk/1 feedback retrial G-queue, balking and reneging, search of customers with vacation Online publication date: Fri, 09-Feb-2018
by J. Radha; K. Indhira; V.M. Chandrasekaran
International Journal of Knowledge Management in Tourism and Hospitality (IJKMTH), Vol. 1, No. 4, 2017
Abstract: This paper deals with the steady state analysis of unreliable batch arrival feedback retrial queue with k stages of service and Bernoulli vacation policy, where the busy server is subjected to breakdown due to the arrival of negative customers. After completion of the ith, (i = 1, 2, ..., k) stage of service, the customer may have the option to choose (i + 1)th stage with probability θi, with probability pi may join into orbit as feedback customer or may leave the system with probability 1 − θi − pi = qi, if the service is successful. The server takes Bernoulli vacation after the service completion. Arriving positive customers may balk (or renege) the system at particular times. After completion of the service, vacation or repair, the server searches for the customer in the orbit or remains idle. The system is solved by using the supplementary variable method and numerical illustrations are discussed.
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 Knowledge Management in Tourism and Hospitality (IJKMTH):
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