Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees

IF 0.7 4区 管理学 Q3 Engineering Military Operations Research Pub Date : 2023-04-28 DOI:10.1287/opre.2022.2416
Xuefeng Gao, Jun-fei Huang, Jiheng Zhang
{"title":"Technical Note—Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees","authors":"Xuefeng Gao, Jun-fei Huang, Jiheng Zhang","doi":"10.1287/opre.2022.2416","DOIUrl":null,"url":null,"abstract":"Both walk-in and online customers appear in many service systems such as restaurants. Online customers are often given a target time for pick up, and the quality of the food/beverage can degrade if it is ready before the arrival of online customers. This distinctive feature brings essential difficulties in the analysis and control of such systems. In “Technical Note: Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees,” Gao, Huang, and Zhang study the optimal control problem of such service systems based on a two-class single server queueing model. The paper proposes a nearly-optimal policy that keeps the server idle when the queue of online customers drops below a threshold and there are no walk-in customers.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"29 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.2416","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

Both walk-in and online customers appear in many service systems such as restaurants. Online customers are often given a target time for pick up, and the quality of the food/beverage can degrade if it is ready before the arrival of online customers. This distinctive feature brings essential difficulties in the analysis and control of such systems. In “Technical Note: Asymptotically Optimal Control of Omnichannel Service Systems with Pick-up Guarantees,” Gao, Huang, and Zhang study the optimal control problem of such service systems based on a two-class single server queueing model. The paper proposes a nearly-optimal policy that keeps the server idle when the queue of online customers drops below a threshold and there are no walk-in customers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
技术笔记-带提货保证的全通道服务系统的渐近最优控制
在餐馆等许多服务系统中,都出现了上门顾客和网上顾客。在线顾客通常会得到一个取货的目标时间,如果在在线顾客到来之前就准备好了,那么食品/饮料的质量就会下降。这种独特的特性给分析和控制这类系统带来了本质上的困难。在“Technical Note:带提货保证的全渠道服务系统的渐近最优控制”中,Gao, Huang, Zhang基于两类单服务器排队模型研究了这类服务系统的最优控制问题。本文提出了一种近乎最优的策略,当在线客户队列下降到阈值以下且没有客户进入时,服务器保持空闲。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
期刊最新文献
Optimal Routing Under Demand Surges: The Value of Future Arrival Rates Demand Estimation Under Uncertain Consideration Sets Optimal Routing to Parallel Servers in Heavy Traffic The When and How of Delegated Search A Data-Driven Approach to Beating SAA Out of Sample
×
引用
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