scholarly journals Feedback of a Non-Truncated Erlang Queuing System with Balking and Retention of Reneged Customers

2018 ◽  
Vol 7 (2) ◽  
pp. 40
Author(s):  
Kotb Abdel Hamid Kotb
Keyword(s):  
Queuing System ◽  
Retention Of Reneged Customers

Performance Analysis of a Markovian Queuing System with Reneging and Retention of Reneged Customers

2017 ◽  
pp. 686-694
Author(s):  
Rakesh Kumar
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Cost Model ◽  
Customer Retention ◽  
System Size ◽  
Retention Mechanism ◽  
Queuing System ◽  
System Capacity ◽  
Service Rate ◽  
Retention Of Reneged Customers

In this chapter a finite capacity single server Markovian queuing system with reneging and retention of reneged customers is considered. It is envisaged that a reneging customer may be convinced to stay for his service if some customer retention mechanism is employed. Thus, there is a probability that a reneging customer may be retained. Steady-state balance equations of the model are derived using Markov chain theory. The steady-state probabilities of system size are obtained explicitly by using iterative method. The performance measures like expected system size, expected rate of reneging, and expected rate of retention are obtained. The effect of probability of retaining a reneging customer on the performance measures is studied. The economic analysis of the model is performed by developing a cost model. The optimum service rate and optimum system capacity are obtained using classical optimization and pattern search techniques. The optimization carried out helps to identify the optimum customer retention strategy from among many.

Performance Analysis of a Markovian Queuing System with Reneging and Retention of Reneged Customers

2016 ◽  
pp. 97-105
Author(s):  
Rakesh Kumar
Keyword(s):  
Steady State ◽  
Performance Measures ◽  
Cost Model ◽  
Customer Retention ◽  
System Size ◽  
Retention Mechanism ◽  
Queuing System ◽  
System Capacity ◽  
Service Rate ◽  
Retention Of Reneged Customers

In this chapter a finite capacity single server Markovian queuing system with reneging and retention of reneged customers is considered. It is envisaged that a reneging customer may be convinced to stay for his service if some customer retention mechanism is employed. Thus, there is a probability that a reneging customer may be retained. Steady-state balance equations of the model are derived using Markov chain theory. The steady-state probabilities of system size are obtained explicitly by using iterative method. The performance measures like expected system size, expected rate of reneging, and expected rate of retention are obtained. The effect of probability of retaining a reneging customer on the performance measures is studied. The economic analysis of the model is performed by developing a cost model. The optimum service rate and optimum system capacity are obtained using classical optimization and pattern search techniques. The optimization carried out helps to identify the optimum customer retention strategy from among many.

scholarly journals A single-server Markovian queuing system with discouraged arrivals and retention of reneged customers

2014 ◽  
Vol 24 (1) ◽  
pp. 119-126 ◽  
Author(s):  
Rakesh Kumar ◽  
Kumar Sharma
Keyword(s):  
Negative Impact ◽  
Steady State Solution ◽  
Queuing System ◽  
Point Of View ◽  
Single Server ◽  
Queuing Model ◽  
Queuing Models ◽  
Special Cases ◽  
Retention Of Reneged Customers ◽  
Measures Of Effectiveness

Customer impatience has a very negative impact on the queuing system under investigation. If we talk from business point of view, the firms lose their potential customers due to customer impatience, which affects their business as a whole. If the firms employ certain customer retention strategies, then there are chances that a certain fraction of impatient customers can be retained in the queuing system. A reneged customer may be convinced to stay in the queuing system for his further service with some probability, say q and he may abandon the queue without receiving the service with a probability p(=1? q). A finite waiting space Markovian single-server queuing model with discouraged arrivals, reneging and retention of reneged customers is studied. The steady state solution of the model is derived iteratively. The measures of effectiveness of the queuing model are also obtained. Some important queuing models are derived as special cases of this model.

Algorithmic Approach to Analysis of Queuing System with Finite Queues and Jump-like Priorities

2012 ◽  
Vol 44 (12) ◽  
pp. 43-54 ◽  
Author(s):  
Agasi Zarbali ogly Melikov ◽  
Leonid A. Ponomarenko ◽  
Che Soong Kim
Keyword(s):  
Queuing System ◽  
Algorithmic Approach ◽  
Finite Queues
Sign in / Sign up

Export Citation Format

Share Document