Optimizing Resource Allocation in M/M/1/N Queues with Feedback, Discouraged Arrivals, and Reneging for Enhanced Service Delivery

IF 0.9 Q3 STATISTICS & PROBABILITY
Savita, Amit Kumar, Chandra Shekhar
{"title":"Optimizing Resource Allocation in M/M/1/N Queues with Feedback, Discouraged Arrivals, and Reneging for Enhanced Service Delivery","authors":"Savita, Amit Kumar, Chandra Shekhar","doi":"10.13052/jrss0974-8024.1711","DOIUrl":null,"url":null,"abstract":"This article presents a novel computational approach for analyzing M/M/1/N queues with feedback, discouraged arrivals, and reneging, under the first-come, first-served (FCFS) discipline. We calculate explicit transient state probabilities and represent results using symmetric tridiagonal matrix eigenvalues. Through numerical simulations, we validate our method, providing practical insights for optimizing resource allocation. Our study contributes to both theory and application, advancing queueing theory and aiding decision-makers in improving service quality and resource management.","PeriodicalId":42526,"journal":{"name":"Journal of Reliability and Statistical Studies","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Reliability and Statistical Studies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13052/jrss0974-8024.1711","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0

Abstract

This article presents a novel computational approach for analyzing M/M/1/N queues with feedback, discouraged arrivals, and reneging, under the first-come, first-served (FCFS) discipline. We calculate explicit transient state probabilities and represent results using symmetric tridiagonal matrix eigenvalues. Through numerical simulations, we validate our method, providing practical insights for optimizing resource allocation. Our study contributes to both theory and application, advancing queueing theory and aiding decision-makers in improving service quality and resource management.
优化 M/M/1/N 队列中的资源分配,同时考虑反馈、受挫到达和背弃,以提高服务交付能力
本文提出了一种新颖的计算方法,用于分析先到先得(FCFS)规则下带有反馈、不鼓励到达和反悔的 M/M/1/N 队列。我们计算明确的瞬态概率,并使用对称三对角矩阵特征值表示结果。通过数值模拟,我们验证了我们的方法,为优化资源分配提供了实用见解。我们的研究对理论和应用都有贡献,推动了队列理论的发展,并帮助决策者改善服务质量和资源管理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.60
自引率
12.50%
发文量
24
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信