Abstract
Customer retrials are very common phenomena in industrial engineering and business management. The number of retrials required before receiving a success is an important measure for evaluating system performance. Focusing on the M/M/1 and M/M/2 retrial queues, we study the conditional probability of a successful retrial given that all previous retrials have been denied. The idea is to obtain the recursive expressions based on the properties of continued fractions and the transient solutions of systems. The result leads to computational algorithms for the probability of the number of retrials made by a blocked primary customer. Through implementation of the proposed algorithms, numerical examples and analysis are presented to show computational efficiency and properties of the conditional probability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: INFOR: Information Systems and Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
