scholarly journals The Sensitivity Analysis of Service and Waiting Costs of A Multi Server Queuing Model

Author(s):  
S Vijay Prasad ◽  
Ranadheer Donthi ◽  
Mahesh Kumar Challa
2018 ◽  
Vol 28 (3) ◽  
pp. 333-344 ◽  
Author(s):  
Bhupender Som ◽  
Sunny Seth

Customers often get attracted by lucrative deals and discounts offered by firms. These, attracted customers are termed as encouraged arrivals. In this paper, we developed a multi-server Feedback Markovian queuing model with encouraged arrivals, customer impatience, and retention of impatient customers. The stationary system size probabilities are obtained recursively. Also, we presented the necessary measures of performance and gave numerical illustrations. Some particular, and special cases of the model are discussed.


Mathematics ◽  
2021 ◽  
Vol 9 (17) ◽  
pp. 2134
Author(s):  
Alexander Dudin ◽  
Olga Dudina ◽  
Sergei Dudin ◽  
Konstantin Samouylov

A novel multi-server vacation queuing model is considered. The distinguishing feature of the model, compared to the standard queues, is the self-sufficiency of servers. A server can terminate service and go on vacation independently of the system manager and the overall situation in the system. The system manager can make decisions whether to allow the server to start work after vacation completion and when to try returning some server from a vacation to process customers. The arrival flow is defined by a general batch Markov arrival process. The problem of optimal choice of the total number of servers and the thresholds defining decisions of the manager arises. To solve this problem, the behavior of the system is described by the three-dimensional Markov chain with the special block structure of the generator. Conditions for the ergodicity of this chain are derived, the problem of computation of the steady-state distribution of the chain is discussed. Expressions for the key performance indicators of the system in terms of the distribution of the chain states are derived. An illustrative numerical result is presented.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 169623-169639
Author(s):  
Godlove Suila Kuaban ◽  
Rakesh Kumar ◽  
Bhavneet Singh Soodan ◽  
Piotr Czekalski

2015 ◽  
Vol 3 (3) ◽  
pp. 97 ◽  
Author(s):  
Vijay Prasad ◽  
Badshah V.H ◽  
Tariq Ahmad Koka

<p>In the research paper entitled Mathematical Analysis of Single Queue Multi Server and Multi Queue Multi Server Queuing Model, Prasad and Badshah [7] were proved that single queue multi server model is better than multi queue multi server model, and discussed the relation between the performance measures of these two models, and derive the mathematical equations. In this paper we derive the total cost with assumption of certain Waiting cost in both cases. Also, prove that the expected total cost is less for single queue multi server model as comparing with multi queue multi server model.</p>


1978 ◽  
Vol 15 (4) ◽  
pp. 826-834 ◽  
Author(s):  
Shirley A. Nozaki ◽  
Sheldon M. Ross

An approximation for the average delay in queue of an entering customer is presented for the M/G/K queuing model with finite capacity. The approximation is obtained by means of an approximation relating a joint distribution of remaining service time to the equilibrium service distribution.


1978 ◽  
Vol 15 (04) ◽  
pp. 826-834 ◽  
Author(s):  
Shirley A. Nozaki ◽  
Sheldon M. Ross

An approximation for the average delay in queue of an entering customer is presented for the M/G/K queuing model with finite capacity. The approximation is obtained by means of an approximation relating a joint distribution of remaining service time to the equilibrium service distribution.


Sign in / Sign up

Export Citation Format

Share Document