Analysis and optimisation of a M/M/1/WV queue with Bernoulli schedule vacation interruption and customer’s impatience

Pub Date : 2021-12-01 DOI:10.2478/ausm-2021-0023
Shakir Majid, A. Bouchentouf, Abdelhak Guendouzi
{"title":"Analysis and optimisation of a M/M/1/WV queue with Bernoulli schedule vacation interruption and customer’s impatience","authors":"Shakir Majid, A. Bouchentouf, Abdelhak Guendouzi","doi":"10.2478/ausm-2021-0023","DOIUrl":null,"url":null,"abstract":"Abstract In this investigation, we establish a steady-state solution of an infinite-space single-server Markovian queueing system with working vacation (WV), Bernoulli schedule vacation interruption, and impatient customers. Once the system becomes empty, the server leaves the system and takes a vacation with probability p or a working vacation with probability 1 − p, where 0 ≤ p ≤ 1. The working vacation period is interrupted if the system is non empty at a service completion epoch and the server resumes its regular service period with probability 1 − q or carries on with the working vacation with probability q. During vacation and working vacation periods, the customers may be impatient and leave the system. We use a probability generating function technique to obtain the expected number of customers and other system characteristics. Stochastic decomposition of the queueing model is given. Then, a cost function is constructed by considering different cost elements of the system states, in order to determine the optimal values of the service rate during regular busy period, simultaneously, to minimize the total expected cost per unit time by using a quadratic fit search method (QFSM). Further, by taking illustration, numerical experiment is performed to validate the analytical results and to examine the impact of different parameters on the system characteristics.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausm-2021-0023","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract In this investigation, we establish a steady-state solution of an infinite-space single-server Markovian queueing system with working vacation (WV), Bernoulli schedule vacation interruption, and impatient customers. Once the system becomes empty, the server leaves the system and takes a vacation with probability p or a working vacation with probability 1 − p, where 0 ≤ p ≤ 1. The working vacation period is interrupted if the system is non empty at a service completion epoch and the server resumes its regular service period with probability 1 − q or carries on with the working vacation with probability q. During vacation and working vacation periods, the customers may be impatient and leave the system. We use a probability generating function technique to obtain the expected number of customers and other system characteristics. Stochastic decomposition of the queueing model is given. Then, a cost function is constructed by considering different cost elements of the system states, in order to determine the optimal values of the service rate during regular busy period, simultaneously, to minimize the total expected cost per unit time by using a quadratic fit search method (QFSM). Further, by taking illustration, numerical experiment is performed to validate the analytical results and to examine the impact of different parameters on the system characteristics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
考虑伯努利调度休假中断和顾客不耐烦的M/M/1/WV队列分析与优化
摘要本文建立了具有工作假期、伯努利计划假期中断和客户不耐烦的无限空间单服务器马尔可夫排队系统的稳态解。当系统空闲时,服务器离开系统,休假的概率为p或工作休假的概率为1−p,其中0≤p≤1。如果在某个服务完成时刻系统非空,服务器以1−q的概率恢复正常服务时段,或者以q的概率继续工作假期,则工作假期中断。在休假和工作假期期间,客户可能会不耐烦而离开系统。我们使用概率生成函数技术来获得期望的客户数量和其他系统特征。给出了排队模型的随机分解。然后,考虑系统状态的不同成本要素,构造成本函数,确定常规繁忙时段服务率的最优值,同时利用二次拟合搜索法(QFSM)使单位时间总期望成本最小。通过实例,进行了数值实验,验证了分析结果,并考察了不同参数对系统特性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1