重叠客户的数量

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Onno Boxma
{"title":"重叠客户的数量","authors":"Onno Boxma","doi":"10.1016/j.orl.2024.107203","DOIUrl":null,"url":null,"abstract":"<div><div>We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to the FCFS policy, we obtain the probability generating function and moments of the number of overlaps in the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn><mo>/</mo><mi>N</mi></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> and <span><math><mi>G</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> queue and (as an approximation) the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mi>c</mi></math></span> queue.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"57 ","pages":"Article 107203"},"PeriodicalIF":0.8000,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The number of overlapping customers\",\"authors\":\"Onno Boxma\",\"doi\":\"10.1016/j.orl.2024.107203\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to the FCFS policy, we obtain the probability generating function and moments of the number of overlaps in the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn><mo>/</mo><mi>N</mi></math></span>, <span><math><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> and <span><math><mi>G</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></math></span> queue and (as an approximation) the <span><math><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mi>c</mi></math></span> queue.</div></div>\",\"PeriodicalId\":54682,\"journal\":{\"name\":\"Operations Research Letters\",\"volume\":\"57 \",\"pages\":\"Article 107203\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Operations Research Letters\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0167637724001391\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637724001391","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑了多个单服务器和多服务器队列中的重叠客户数量,即在某个时间点访问服务系统的客户数量与标记客户的访问数量重叠。限于 FCFS 策略,我们得到了 M/G/1、M/G/1/N、M/M/c 和 G/M/c 队列以及(近似)M/G/c 队列中重叠数量的概率生成函数和矩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The number of overlapping customers
We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to the FCFS policy, we obtain the probability generating function and moments of the number of overlaps in the M/G/1, M/G/1/N, M/M/c and G/M/c queue and (as an approximation) the M/G/c queue.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
×
引用
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学术官方微信