Analysis of batch arrival bulk service queue with additional optional service multiple vacation and setup time

G. Ayyappan, T. Deepa
{"title":"Analysis of batch arrival bulk service queue with additional optional service multiple vacation and setup time","authors":"G. Ayyappan, T. Deepa","doi":"10.1504/IJMOR.2019.10022827","DOIUrl":null,"url":null,"abstract":"This paper studies an M[x]/G(a, b)/1 queuing system with additional optional service, multiple vacation and setup time. After completing the first service, the customers may opt for the second service with probability α or leave the system with probability 1 ‒ α. After completing a bulk service, if the queue size is less than 'α', then the server leaves for a vacation of random length. When he returns from the vacation, if the queue length is still less than 'α', he leaves for another vacation and so on. This process continues until he finds at least 'α' customer in the queue. After a vacation, if the server finds at least 'α' customer waiting for service, he requires a setup time 'G' to start the service. After this setup, he serves a batch of ξ customers (a ≤ ξ ≤ b). Using supplementary variable technique, the probability generating function (PGF) of the queue size, expected queue length, expected waiting time, expected busy period and expected idle period are derived. Numerical illustrations are presented to visualise the effect of system parameters.","PeriodicalId":306451,"journal":{"name":"Int. J. Math. Oper. Res.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Math. Oper. Res.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJMOR.2019.10022827","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper studies an M[x]/G(a, b)/1 queuing system with additional optional service, multiple vacation and setup time. After completing the first service, the customers may opt for the second service with probability α or leave the system with probability 1 ‒ α. After completing a bulk service, if the queue size is less than 'α', then the server leaves for a vacation of random length. When he returns from the vacation, if the queue length is still less than 'α', he leaves for another vacation and so on. This process continues until he finds at least 'α' customer in the queue. After a vacation, if the server finds at least 'α' customer waiting for service, he requires a setup time 'G' to start the service. After this setup, he serves a batch of ξ customers (a ≤ ξ ≤ b). Using supplementary variable technique, the probability generating function (PGF) of the queue size, expected queue length, expected waiting time, expected busy period and expected idle period are derived. Numerical illustrations are presented to visualise the effect of system parameters.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有附加可选服务、多假期和设置时间的批量到达批量服务队列分析
研究了一类具有附加可选服务、多假期和设置时间的M[x]/G(a, b)/1排队系统。在完成第一次服务后,顾客可能选择第二次服务,概率为α,或者以1 - α的概率离开系统。在完成批量服务后,如果队列大小小于'α',则服务器离开一个随机长度的假期。当他休假回来时,如果队列长度仍然小于'α',他就离开去另一个假期,以此类推。这个过程一直持续,直到他在队列中找到至少一个“α”客户。假期结束后,如果服务器发现至少有“α”客户等待服务,则需要设置时间“G”来启动服务。在此设置之后,他为一批(a≤ξ≤b)的顾客提供服务。利用补充变量技术,导出了队列大小、期望队列长度、期望等待时间、期望繁忙时间和期望空闲时间的概率生成函数PGF。为了使系统参数的影响可视化,给出了数值说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Availability analysis of a complex system consisting of two subsystems in parallel configuration with replacement at failure An inventory model for deteriorating items with preservation facility of ramp type demand and trade credit Performance prediction and ANFIS computing for unreliable retrial queue with delayed repair under modified vacation policy Material selection through of multi-criteria decisions methods applied to a helical gearbox Stability of the optimal distribution for the searching effort to find the Markovian targets by using fuzzy maximum discounted effort reward search: case of the cooperative search techniques
×
引用
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