手术时间不确定下非手术室麻醉(NORA)的鲁棒手术计划

IF 2.8 4区 管理学 Q2 MANAGEMENT
Jian-Jun Wang, Zongli Dai, Jasmine Chang, Jim (Junmin) Shi, Haiguan Liu
{"title":"手术时间不确定下非手术室麻醉(NORA)的鲁棒手术计划","authors":"Jian-Jun Wang,&nbsp;Zongli Dai,&nbsp;Jasmine Chang,&nbsp;Jim (Junmin) Shi,&nbsp;Haiguan Liu","doi":"10.1111/deci.12584","DOIUrl":null,"url":null,"abstract":"<p><i>Nonoperating room anesthesia</i> (NORA) refers to the practice and administration of anesthesia or sedation outside the <i>operating room</i> (OR), which has been increasingly implemented in practice. The novelty of NORA is to separate the anesthesia preoperative stage from an OR for the sake of saving OR time and improving its efficiency. In this article, we study the scheduling problem for NORA considering both <i>anesthetic rooms</i> (ARs) and <i>operating rooms</i> (ORs) based on ambiguous information about surgical durations. Our goal is to devise a robust and efficient scheduling mechanism for NORA. To address this problem, we develop a two-stage mixed-integer <i>Robust Optimization</i> (RO) model that minimizes the total costs, including the sum of operating costs of opened ORs and ARs, delay cost of surgeries, and overtime cost of ORs. Decisions include the number of ARs and ORs to open, the allocation of patients to ARs and ORs, the sequence of surgeries, and the planned starting time for each surgery. Accordingly, a heuristic algorithm, so-called <i>column-and-constraint generation</i> (C&amp;CG), is developed that renders a desirable performance. Some salient properties of the problem are also discussed. In addition, by leveraging practical data in conjunction with data reported in the extant research, the computational efficacy of the proposed algorithm is verified under various sets of parameters. Our numerical experiments reveal that (1) the implementation of NORA can reduce the OR overtime cost and the waiting time of patients; (2) our proposed <i>Robust Optimization</i> (RO) model possesses stronger robustness and computational efficiency than the <i>distributionally robust model</i> (DRO); and (3) while considering surgical duration uncertainty, the developed scheduling approach outperforms the corresponding deterministic setting in terms of decreasing the total cost and alleviating the surgery delay. Generally, the proposed approach is more adaptive to take the advantage of the surgical duration uncertainty to enhance its efficacy.</p>","PeriodicalId":48256,"journal":{"name":"DECISION SCIENCES","volume":"55 3","pages":"262-280"},"PeriodicalIF":2.8000,"publicationDate":"2022-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Robust surgical scheduling for nonoperating room anesthesia (NORA) under surgical duration uncertainty\",\"authors\":\"Jian-Jun Wang,&nbsp;Zongli Dai,&nbsp;Jasmine Chang,&nbsp;Jim (Junmin) Shi,&nbsp;Haiguan Liu\",\"doi\":\"10.1111/deci.12584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><i>Nonoperating room anesthesia</i> (NORA) refers to the practice and administration of anesthesia or sedation outside the <i>operating room</i> (OR), which has been increasingly implemented in practice. The novelty of NORA is to separate the anesthesia preoperative stage from an OR for the sake of saving OR time and improving its efficiency. In this article, we study the scheduling problem for NORA considering both <i>anesthetic rooms</i> (ARs) and <i>operating rooms</i> (ORs) based on ambiguous information about surgical durations. Our goal is to devise a robust and efficient scheduling mechanism for NORA. To address this problem, we develop a two-stage mixed-integer <i>Robust Optimization</i> (RO) model that minimizes the total costs, including the sum of operating costs of opened ORs and ARs, delay cost of surgeries, and overtime cost of ORs. Decisions include the number of ARs and ORs to open, the allocation of patients to ARs and ORs, the sequence of surgeries, and the planned starting time for each surgery. Accordingly, a heuristic algorithm, so-called <i>column-and-constraint generation</i> (C&amp;CG), is developed that renders a desirable performance. Some salient properties of the problem are also discussed. In addition, by leveraging practical data in conjunction with data reported in the extant research, the computational efficacy of the proposed algorithm is verified under various sets of parameters. Our numerical experiments reveal that (1) the implementation of NORA can reduce the OR overtime cost and the waiting time of patients; (2) our proposed <i>Robust Optimization</i> (RO) model possesses stronger robustness and computational efficiency than the <i>distributionally robust model</i> (DRO); and (3) while considering surgical duration uncertainty, the developed scheduling approach outperforms the corresponding deterministic setting in terms of decreasing the total cost and alleviating the surgery delay. Generally, the proposed approach is more adaptive to take the advantage of the surgical duration uncertainty to enhance its efficacy.</p>\",\"PeriodicalId\":48256,\"journal\":{\"name\":\"DECISION SCIENCES\",\"volume\":\"55 3\",\"pages\":\"262-280\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2022-10-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DECISION SCIENCES\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1111/deci.12584\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DECISION SCIENCES","FirstCategoryId":"91","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/deci.12584","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
引用次数: 0

摘要

非手术室麻醉(NORA)是指在手术室(OR)外进行麻醉或镇静的操作和实施,目前已越来越多地在实践中实施。非手术室麻醉的新颖之处在于将麻醉术前阶段从手术室中分离出来,以节省手术室时间并提高其效率。本文研究了基于手术持续时间的模糊信息,同时考虑麻醉室(AR)和手术室(OR)的 NORA 调度问题。我们的目标是为 NORA 设计一种稳健高效的调度机制。为了解决这个问题,我们开发了一个两阶段混合整数稳健优化(RO)模型,该模型最大限度地降低了总成本,包括开放手术室和 AR 的运营成本之和、手术延迟成本和手术室加班成本。决策包括开放 AR 和手术室的数量、将病人分配到 AR 和手术室、手术顺序以及每个手术的计划开始时间。因此,我们开发了一种启发式算法,即所谓的 "列和约束生成(C&CG)",该算法具有理想的性能。本文还讨论了该问题的一些突出特性。此外,通过利用实际数据和现有研究报告中的数据,验证了所提算法在不同参数集下的计算功效。我们的数值实验表明:(1) NORA 的实施可以减少手术室的加班费用和病人的等待时间;(2) 与分布鲁棒模型(DRO)相比,我们提出的鲁棒优化模型(RO)具有更强的鲁棒性和计算效率;(3) 在考虑手术持续时间不确定性的情况下,所开发的调度方法在降低总成本和缓解手术延迟方面优于相应的确定性设置。总体而言,所提出的方法更具适应性,可利用手术持续时间的不确定性来提高其功效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Robust surgical scheduling for nonoperating room anesthesia (NORA) under surgical duration uncertainty

Nonoperating room anesthesia (NORA) refers to the practice and administration of anesthesia or sedation outside the operating room (OR), which has been increasingly implemented in practice. The novelty of NORA is to separate the anesthesia preoperative stage from an OR for the sake of saving OR time and improving its efficiency. In this article, we study the scheduling problem for NORA considering both anesthetic rooms (ARs) and operating rooms (ORs) based on ambiguous information about surgical durations. Our goal is to devise a robust and efficient scheduling mechanism for NORA. To address this problem, we develop a two-stage mixed-integer Robust Optimization (RO) model that minimizes the total costs, including the sum of operating costs of opened ORs and ARs, delay cost of surgeries, and overtime cost of ORs. Decisions include the number of ARs and ORs to open, the allocation of patients to ARs and ORs, the sequence of surgeries, and the planned starting time for each surgery. Accordingly, a heuristic algorithm, so-called column-and-constraint generation (C&CG), is developed that renders a desirable performance. Some salient properties of the problem are also discussed. In addition, by leveraging practical data in conjunction with data reported in the extant research, the computational efficacy of the proposed algorithm is verified under various sets of parameters. Our numerical experiments reveal that (1) the implementation of NORA can reduce the OR overtime cost and the waiting time of patients; (2) our proposed Robust Optimization (RO) model possesses stronger robustness and computational efficiency than the distributionally robust model (DRO); and (3) while considering surgical duration uncertainty, the developed scheduling approach outperforms the corresponding deterministic setting in terms of decreasing the total cost and alleviating the surgery delay. Generally, the proposed approach is more adaptive to take the advantage of the surgical duration uncertainty to enhance its efficacy.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
DECISION SCIENCES
DECISION SCIENCES MANAGEMENT-
CiteScore
12.40
自引率
1.80%
发文量
34
期刊介绍: Decision Sciences, a premier journal of the Decision Sciences Institute, publishes scholarly research about decision making within the boundaries of an organization, as well as decisions involving inter-firm coordination. The journal promotes research advancing decision making at the interfaces of business functions and organizational boundaries. The journal also seeks articles extending established lines of work assuming the results of the research have the potential to substantially impact either decision making theory or industry practice. Ground-breaking research articles that enhance managerial understanding of decision making processes and stimulate further research in multi-disciplinary domains are particularly encouraged.
×
引用
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学术官方微信