Open Access
Subscription or Fee Access
Analysis of Customer’s Impatience in Single Server Markovian Queuing Model
Abstract
This paper aims to develop a model for a single server queue with Markovian features that accounts for customer impatience. We use the rate in rate out principle and the Markov process method to find the steady state probabilities. We obtain closed form expressions for both conventional and newly proposed measures. To illustrate the practical application of our results, a numerical example is provided. Sensitivity analysis using numerical
techniques is conducted to explore how different performance measures change with variations in system parameters. Additionally, we perform cost analysis to examine how balking and reneging influence the expected profit using parabolic optimization technique. This research helps us to comprehend how impatience affects queue systems and offers useful guidance for optimizing their performance and cost.
Keywords
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. Journal never mentioned that we have DOI number. However, to get free DOI, author can register your work which published with Zonodo (https://zenodo.org/signup/). We have no objection for this open access repository.