The number of overlapping customers

IF 0.8 4区管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Operations Research Letters Pub Date : 2024-11-01 DOI:10.1016/j.orl.2024.107203

Onno Boxma

引用次数: 0

Abstract

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.

查看原文本刊更多论文

重叠客户的数量

我们考虑了多个单服务器和多服务器队列中的重叠客户数量，即在某个时间点访问服务系统的客户数量与标记客户的访问数量重叠。限于 FCFS 策略，我们得到了 M/G/1、M/G/1/N、M/M/c 和 G/M/c 队列以及（近似）M/G/c 队列中重叠数量的概率生成函数和矩。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

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.