Optimality of Finite Capacity Markovian Queues with Discouraged Arrivals and Singlhiatus with Waiting Server

Q4 Mathematics
J. Vimal Andrew
{"title":"Optimality of Finite Capacity Markovian Queues with Discouraged Arrivals and Singlhiatus with Waiting Server","authors":"J. Vimal Andrew","doi":"10.52783/cana.v31.1052","DOIUrl":null,"url":null,"abstract":"We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.","PeriodicalId":40036,"journal":{"name":"Communications on Applied Nonlinear Analysis","volume":" 15","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications on Applied Nonlinear Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52783/cana.v31.1052","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 0

Abstract

We consider finite-capacity Markovian queues with a single hiatus scheme and waiting server. Customers are arriving at a Poisson arrival λ and exponential service distribution, with a mean service rate µ. In which customers join the queue according to the number of customers in the system while the hiatus is in the service-providing process. For the assumed queuing model, steady-state probabilities were derived, and some important performance measures, such as the mean number of customers in the system and mean response time in the system and queue are analysed. The expected expense function is developed and formulated as an optimization problem in order to find the minimum expense. Numerical illustrations are given to show the effect of parameters on the performance measures.
有限容量马尔可夫队列的最优性(带受阻到达和带等待服务器的单一队列
我们考虑的是有限容量马尔可夫队列,该队列具有单一间歇方案和等待服务器。客户以泊松到达λ和指数服务分布到达,平均服务率为 µ。其中,客户根据系统中的客户数量加入队列,而间歇则处于服务提供过程中。对于假定的排队模型,得出了稳态概率,并分析了一些重要的性能指标,如系统中的平均客户数、系统和队列中的平均响应时间。开发了预期支出函数,并将其表述为一个优化问题,以找到最小支出。给出了数值说明,以显示参数对性能指标的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.30
自引率
0.00%
发文量
0
×
引用
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学术官方微信