DSpace logo

Please use this identifier to cite or link to this item: http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/11044
Title: Matrix-geometric solution of multi-server queueing systems with Bernoulli scheduled modified vacation and retention of reneged customers: A meta-heuristic approach
Authors: Shekhar, Chandra
Keywords: Mathematics
Bernoulli modified vacation policy
Retention of the reneged customer
State-dependent service rate
Emergency vacation
Particle swarm optimization (PSO)
Issue Date: May-2020
Publisher: Taylor & Francis
Abstract: In the present article, we deal with the multi-server finite capacity queueing system with Bernoulli’s scheduled modified vacation policy and the realistic retaining policy of reneged customers. After completion of the service of any customer, the server decides whether to go for the vacation of random duration or to continue facilitating the service to the waiting customer, if any, present in the queue. All servers, homogeneous in nature, provide the state-dependent service following the threshold policy to reduce the overload of the system. The impatience behavior of customers like balking and reneging is also considered in the stochastic modeling of the studied problem. The matrix analytic approach is employed to obtain the steady-state probabilities with which various system performance measures are also developed with practical justification. Finally, the expected cost minimization problem is formulated and dealt with the meta-heuristic approach: particle swarm optimization (PSO). All results of numerical simulation and optimal analysis are summarized in tables and graphs to provide quick insight. The concluding remarks and future scopes have also been discussed.
URI: https://www.tandfonline.com/doi/abs/10.1080/16843703.2020.1755088?journalCode=ttqm20
http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/11044
Appears in Collections:Department of Mathematics

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.