A stochastic optimization model and decomposition techniques for surgery scheduling with duration and emergency demand uncertainty

IF 6.7 1区 工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Xiaoyue Gong , Jian-Jun Wang , Hongru Miao , Lejing Yu , Zhili Liu
{"title":"A stochastic optimization model and decomposition techniques for surgery scheduling with duration and emergency demand uncertainty","authors":"Xiaoyue Gong ,&nbsp;Jian-Jun Wang ,&nbsp;Hongru Miao ,&nbsp;Lejing Yu ,&nbsp;Zhili Liu","doi":"10.1016/j.cie.2025.111096","DOIUrl":null,"url":null,"abstract":"<div><div>A robust and reasonable ex-ante operating rooms (ORs) scheduling for the upcoming surgery day is important as it provides a fundamental reference for equipment management and a working plan for staff physicians. This study aims to develop effective initial OR schedules in the presence of stochastic duration and emergency demand where elective and emergency demand share open multi-functional ORs in a specialty. In addition, physicians’ precedence requirements are considered to ensure that the resulting schedule facilitates the smoothness of each physician’s work under any uncertainty realization. Through characterizing the duration and emergency demand uncertainties by a scenario set, a two-stage stochastic optimization model is formulated to minimize the total expected costs under uncertainties. An effective decomposition algorithm is developed, given that the simpler variant of this problem is known as NP-hard. Several enhancements were added based on the understanding of the proposed problem and the established model. Numerical results highlight the benefits of considering both uncertainties when curating initial OR schedules. The effectiveness of the proposed algorithm and its significant advantage over the commercial solver in terms of efficiency are demonstrated. Finally, to obtain good feasible schedules within a desirably short time, a Monte-Carlo sampling approximation based on our decomposition algorithm is also proposed and its effectiveness is briefly demonstrated.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"204 ","pages":"Article 111096"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002426","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

A robust and reasonable ex-ante operating rooms (ORs) scheduling for the upcoming surgery day is important as it provides a fundamental reference for equipment management and a working plan for staff physicians. This study aims to develop effective initial OR schedules in the presence of stochastic duration and emergency demand where elective and emergency demand share open multi-functional ORs in a specialty. In addition, physicians’ precedence requirements are considered to ensure that the resulting schedule facilitates the smoothness of each physician’s work under any uncertainty realization. Through characterizing the duration and emergency demand uncertainties by a scenario set, a two-stage stochastic optimization model is formulated to minimize the total expected costs under uncertainties. An effective decomposition algorithm is developed, given that the simpler variant of this problem is known as NP-hard. Several enhancements were added based on the understanding of the proposed problem and the established model. Numerical results highlight the benefits of considering both uncertainties when curating initial OR schedules. The effectiveness of the proposed algorithm and its significant advantage over the commercial solver in terms of efficiency are demonstrated. Finally, to obtain good feasible schedules within a desirably short time, a Monte-Carlo sampling approximation based on our decomposition algorithm is also proposed and its effectiveness is briefly demonstrated.
具有持续时间和急诊需求不确定性的手术调度随机优化模型及分解技术
为即将到来的手术日制定一个健全合理的手术室(or)调度是非常重要的,因为它为设备管理提供了基础参考,并为医务人员提供了工作计划。本研究旨在制定有效的初始手术室计划,在随机持续时间和紧急需求存在的情况下,选修和紧急需求共享一个专业的开放多功能手术室。此外,还考虑了医生的优先级要求,以确保在任何不确定性实现的情况下,得出的时间表有利于每位医生工作的顺利进行。通过用情景集描述持续时间和应急需求的不确定性,建立了在不确定性条件下总期望成本最小化的两阶段随机优化模型。考虑到这个问题的简单变体被称为NP-hard,我们开发了一个有效的分解算法。基于对提出的问题和已建立的模型的理解,添加了一些增强功能。数值结果强调了在规划初始OR计划时考虑这两种不确定性的好处。实验证明了该算法的有效性,并在效率方面优于商业求解器。最后,为了在较短的时间内获得较好的可行调度,本文还提出了一种基于分解算法的蒙特卡罗采样近似,并简要证明了其有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Industrial Engineering
Computers & Industrial Engineering 工程技术-工程:工业
CiteScore
12.70
自引率
12.70%
发文量
794
审稿时长
10.6 months
期刊介绍: Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.
×
引用
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学术官方微信