An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm

IF 1.1 4区 数学 Q4 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Yuli Wang, Wenjuan Fan, Shaowen Lan, Shuwan Zhu, Jianmei Du
{"title":"An integrated operating room and physician scheduling problem solved by a hybrid variable neighborhood search-based algorithm","authors":"Yuli Wang, Wenjuan Fan, Shaowen Lan, Shuwan Zhu, Jianmei Du","doi":"10.1007/s10878-025-01335-x","DOIUrl":null,"url":null,"abstract":"<p>This paper addresses an integrated operating room (OR) and physician scheduling problem driven by the real-world needs in the surgical department. The OR scheduling problem involves determining the number of ORs to be opened each day, the operation date of each surgery, and the schedule of surgeries in each OR. The physician scheduling problem considers two primary work for physicians: surgery service and consultation service, aiming to assign physicians to shifts and determine their responsibilities for either performing surgeries or providing consultation services in the outpatient department. The integration of these two scheduling problems improves coordination between OR availability and physician schedules, which can directly reduce operational costs and enhance resource utilization in the surgical department. The objective of the integrated problem is to minimize the total costs of the hospital and the patients, including the total waiting cost of patients, the total working cost of physicians, the total opening cost of ORs, and the total overtime cost of ORs. To solve the problem, a hybrid approach DP-H-VNS is proposed, which incorporates dynamic programming (DP), heuristics, and a variable neighborhood search (VNS) algorithm. The DP algorithm is used to assign surgeries to specific ORs, while the proposed heuristic rules are presented to determine the number of ORs to open each day and the scheduling of physicians. The presented VNS algorithm can search for high-quality solutions for the proposed problem and serves as a framework to integrate the DP, heuristics, local search, and shaking procedures. Experimental results demonstrate that the proposed DP-H-VNS is superior to the other compared algorithms on the quality of the found solutions and the performance. These results confirm the effectiveness of the proposed approach in optimizing the resource allocation in the surgical department and improving patient care.</p>","PeriodicalId":50231,"journal":{"name":"Journal of Combinatorial Optimization","volume":"12 1","pages":""},"PeriodicalIF":1.1000,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Optimization","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10878-025-01335-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper addresses an integrated operating room (OR) and physician scheduling problem driven by the real-world needs in the surgical department. The OR scheduling problem involves determining the number of ORs to be opened each day, the operation date of each surgery, and the schedule of surgeries in each OR. The physician scheduling problem considers two primary work for physicians: surgery service and consultation service, aiming to assign physicians to shifts and determine their responsibilities for either performing surgeries or providing consultation services in the outpatient department. The integration of these two scheduling problems improves coordination between OR availability and physician schedules, which can directly reduce operational costs and enhance resource utilization in the surgical department. The objective of the integrated problem is to minimize the total costs of the hospital and the patients, including the total waiting cost of patients, the total working cost of physicians, the total opening cost of ORs, and the total overtime cost of ORs. To solve the problem, a hybrid approach DP-H-VNS is proposed, which incorporates dynamic programming (DP), heuristics, and a variable neighborhood search (VNS) algorithm. The DP algorithm is used to assign surgeries to specific ORs, while the proposed heuristic rules are presented to determine the number of ORs to open each day and the scheduling of physicians. The presented VNS algorithm can search for high-quality solutions for the proposed problem and serves as a framework to integrate the DP, heuristics, local search, and shaking procedures. Experimental results demonstrate that the proposed DP-H-VNS is superior to the other compared algorithms on the quality of the found solutions and the performance. These results confirm the effectiveness of the proposed approach in optimizing the resource allocation in the surgical department and improving patient care.

基于混合变量邻域搜索算法的手术室和医生综合调度问题
本文解决了手术室(OR)和医生的综合调度问题驱动的现实世界的需求,在外科部门。手术室调度问题包括确定每天开放的手术室数量、每次手术的手术日期以及每个手术室的手术安排。医生调度问题考虑医生的两项主要工作:手术服务和会诊服务,旨在分配医生轮班,确定他们在门诊进行手术或提供会诊服务的责任。这两个调度问题的整合提高了手术室可用性和医生调度的协调性,可以直接降低手术成本,提高外科资源利用率。综合问题的目标是使医院和患者的总成本最小,包括患者的总等待成本、医生的总工作成本、手术室的总开业成本和手术室的总加班成本。为了解决这一问题,提出了一种结合动态规划(DP)、启发式算法和可变邻域搜索(VNS)算法的混合方法DP- h -VNS。采用DP算法将手术分配到特定的手术室,并提出启发式规则来确定每天开放的手术室数量和医生的调度。所提出的VNS算法可以为所提出的问题搜索高质量的解,并作为整合DP、启发式、局部搜索和抖动过程的框架。实验结果表明,所提出的DP-H-VNS算法在解的质量和性能上都优于其他比较算法。这些结果证实了所提出的方法在优化外科资源分配和改善患者护理方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Combinatorial Optimization
Journal of Combinatorial Optimization 数学-计算机:跨学科应用
CiteScore
2.00
自引率
10.00%
发文量
83
审稿时长
6 months
期刊介绍: The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering. The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信