Adding servers to reinforce facilities in a spatially distributed queueing system

IF 4.1 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Monir Sabbaghtorkan , Rajan Batta , Qing He
{"title":"Adding servers to reinforce facilities in a spatially distributed queueing system","authors":"Monir Sabbaghtorkan ,&nbsp;Rajan Batta ,&nbsp;Qing He","doi":"10.1016/j.cor.2024.106862","DOIUrl":null,"url":null,"abstract":"<div><div>We study the problem of adding servers to reinforce functioning facilities modeled as spatially distributed <span><math><mrow><mi>M</mi><mo>/</mo><mi>M</mi><mo>/</mo><mi>c</mi></mrow></math></span> type queuing systems. We consider two modes, stationary and interactive. The stationary mode is for a situation in which adding new servers to functioning facilities does not change the demand distribution (e.g., hospital care or vehicle inspection). The interactive mode is for a situation in which adding servers will likely change the demand distribution (e.g., gas stations, electric vehicle charging stations). Here we use the gravity rule to model demand adjustment. A case study is presented based on allocation of gas servers to existing gas stations in an hurricane evacuation event. Managerial insights are provided based on sensitivity analysis.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"173 ","pages":"Article 106862"},"PeriodicalIF":4.1000,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824003344","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

We study the problem of adding servers to reinforce functioning facilities modeled as spatially distributed M/M/c type queuing systems. We consider two modes, stationary and interactive. The stationary mode is for a situation in which adding new servers to functioning facilities does not change the demand distribution (e.g., hospital care or vehicle inspection). The interactive mode is for a situation in which adding servers will likely change the demand distribution (e.g., gas stations, electric vehicle charging stations). Here we use the gravity rule to model demand adjustment. A case study is presented based on allocation of gas servers to existing gas stations in an hurricane evacuation event. Managerial insights are provided based on sensitivity analysis.
在空间分布式排队系统中增加服务器以强化设施
我们研究了在空间分布式 M/M/c 型排队系统中增加服务器以加强功能设施的问题。我们考虑了两种模式,即静止模式和交互模式。静态模式适用于在正常运行的设施中增加新服务器而不改变需求分布的情况(如医院护理或车辆检查)。互动模式适用于增加服务器可能会改变需求分布的情况(如加油站、电动汽车充电站)。在此,我们使用重力法则来模拟需求调整。案例研究基于在飓风疏散事件中为现有加油站分配加油服务器。基于敏感性分析,我们提供了管理见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
×
引用
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学术官方微信