Abstract
In this paper, we present analysis of a single-server finite capacity Markovian queuing system with reneging and retention of impatient customers. It is assumed that arriving customers renege according to an exponential distribution and the reneged customers may be retained with some probability. The cost model of the system is made. The optimal values of service rate and the system capacity are obtained by using search and classical optimization algorithms. Further, the expected system size is compared with and without the optimization of the system. Some important comparisons are done to show the impact of optimization of parameters like system capacity, mean service rate, and the probability of retaining the reneged customers.
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: Indian Journal of Industrial and Applied Mathematics
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.
