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 , Jian-Jun Wang , Hongru Miao , Lejing Yu , 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.
期刊介绍:
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.