• A MULTI-SERVER INFINITE CAPACITY MARKOVIAN FEEDBACK QUEUE WITH BALKING, RENEGING AND RETENTION OF RENEGED CUSTOMERS

P. VIJAYA LAXMI*, T. WONDEWOSEN KASSAHUN

Abstract


We consider a multi-server infinite capacity Markovian feedback queue with reneging, balking and retention of reneged customers in which the inter-arrival and service times follow exponential distribution. The reneging times are assumed to be exponentially distributed. After the completion of service, each customer may rejoin the system as a feedback customer for receiving another regular service with a certain probability. A reneged customer can be retained in many cases by employing certain convincing mechanisms to stay in queue for completion of service. Numerical analysis, cost-profit analysis and optimization of the cost function using simulated annealing method are carried out. The steady-state solution of the model is obtained iteratively. Some performance measures are also derived.


Keywords


retention; reneged customers; queueing system; infinite capacity; feedback; balking; cost-profit analysis; simulated annealing.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/