State-Dependent Estimation of Delay Distributions in Fork-Join Networks

Nitzan Carmeli, G. Yom-Tov, O. Boxma
{"title":"State-Dependent Estimation of Delay Distributions in Fork-Join Networks","authors":"Nitzan Carmeli, G. Yom-Tov, O. Boxma","doi":"10.1287/msom.2022.1167","DOIUrl":null,"url":null,"abstract":"Problem definition: Delay announcements have become an essential tool in service system operations: They influence customer behavior and network efficiency. Most current delay announcement methods are designed for relatively simple environments with a single service station or stations in tandem. However, complex service systems, such as healthcare systems, often have fork-join (FJ) structures. Such systems usually suffer from long delays as a result of both resource scarcity and process synchronization, even when queues are fairly short. These systems may thus require more accurate delay estimation techniques than currently available. Methodology/results: We analyze a network comprising a single-server queue followed by a two-station FJ structure using a recursive construction of the Laplace–Stieltjes transform of the joint delay distribution, conditioning on customers’ movements in the network. Delay estimations are made at the time of arrival to the first station. Using data from an emergency department, we examine the accuracy and the robustness of the proposed approach, explore different model structures, and draw insights regarding the conditions under which the FJ structure should be explicitly modeled. We provide evidence that the proposed methodology is better than other commonly used queueing theory estimators such as last-to-enter-service (which is based on snapshot-principle arguments) and queue length, and we replicate previous results showing that the most accurate estimations are obtained when using our model result as a feature in state-of-the-art machine learning estimation methods. Managerial implications: Our results allow management to implement individual, real-time, state-dependent delay announcements in complex FJ networks. We also provide rules of thumb with which one could decide whether to use a model with an explicit FJ structure or to reduce it to a simpler model requiring less computational effort. Funding: This work was supported by the Dutch Research Council (NWO) Gravitation Programme NETWORKS [Grant 024.002.003], the Israel Ministry of Science and Technology [Grant 880011], and the Israel Science Foundation [Grant 1955/15]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1167 .","PeriodicalId":119284,"journal":{"name":"Manufacturing & Service Operations Management","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.1167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Problem definition: Delay announcements have become an essential tool in service system operations: They influence customer behavior and network efficiency. Most current delay announcement methods are designed for relatively simple environments with a single service station or stations in tandem. However, complex service systems, such as healthcare systems, often have fork-join (FJ) structures. Such systems usually suffer from long delays as a result of both resource scarcity and process synchronization, even when queues are fairly short. These systems may thus require more accurate delay estimation techniques than currently available. Methodology/results: We analyze a network comprising a single-server queue followed by a two-station FJ structure using a recursive construction of the Laplace–Stieltjes transform of the joint delay distribution, conditioning on customers’ movements in the network. Delay estimations are made at the time of arrival to the first station. Using data from an emergency department, we examine the accuracy and the robustness of the proposed approach, explore different model structures, and draw insights regarding the conditions under which the FJ structure should be explicitly modeled. We provide evidence that the proposed methodology is better than other commonly used queueing theory estimators such as last-to-enter-service (which is based on snapshot-principle arguments) and queue length, and we replicate previous results showing that the most accurate estimations are obtained when using our model result as a feature in state-of-the-art machine learning estimation methods. Managerial implications: Our results allow management to implement individual, real-time, state-dependent delay announcements in complex FJ networks. We also provide rules of thumb with which one could decide whether to use a model with an explicit FJ structure or to reduce it to a simpler model requiring less computational effort. Funding: This work was supported by the Dutch Research Council (NWO) Gravitation Programme NETWORKS [Grant 024.002.003], the Israel Ministry of Science and Technology [Grant 880011], and the Israel Science Foundation [Grant 1955/15]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/msom.2022.1167 .
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
分叉连接网络中时延分布的状态相关估计
问题定义:延迟通知已经成为业务系统运行中必不可少的工具,它影响着客户行为和网络效率。目前大多数延迟通知方法都是为相对简单的环境设计的,只有一个或多个服务站串联在一起。然而,复杂的服务系统,如医疗保健系统,通常具有叉形连接(FJ)结构。由于资源稀缺和进程同步,即使队列相当短,这样的系统通常也会遭受长时间的延迟。因此,这些系统可能需要比目前可用的更精确的延迟估计技术。方法/结果:我们分析了一个网络,包括一个单服务器队列,然后是一个两站FJ结构,使用联合延迟分布的Laplace-Stieltjes变换的递归结构,以网络中的客户移动为条件。在到达第一站时进行延误估计。使用来自急诊科的数据,我们检验了所提出方法的准确性和鲁棒性,探索了不同的模型结构,并得出了关于FJ结构应该明确建模的条件的见解。我们提供的证据表明,所提出的方法比其他常用的排队理论估计器(如最后进入服务(基于快照原则参数)和队列长度)更好,并且我们复制了以前的结果,表明当使用我们的模型结果作为最先进的机器学习估计方法的特征时,可以获得最准确的估计。管理意义:我们的结果允许管理层在复杂的FJ网络中实现单独的、实时的、状态相关的延迟通知。我们还提供了经验法则,可以决定是否使用具有显式FJ结构的模型,或者将其简化为需要较少计算量的更简单的模型。本研究得到了荷兰研究理事会(NWO)重力计划网络[Grant 024.002.003]、以色列科技部[Grant 880011]和以色列科学基金会[Grant 1955/15]的支持。补充材料:在线附录可在https://doi.org/10.1287/msom.2022.1167上获得。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Physician Adoption of AI Assistant Disclosing Delivery Performance Information When Consumers Are Sensitive to Promised Delivery Time, Delivery Reliability, and Price Loyalty Currency and Mental Accounting: Do Consumers Treat Points Like Money? Dealership or Marketplace with Fulfillment Services: A Dynamic Comparison Introduction: Frontiers in Operations
×
引用
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