.png){kind=icon}
返回
Dynamic surgery management under uncertainty
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2022.12.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Real-time surgery management involves a complex and dynamic decision-making process. The duration of surgeries in many cases cannot be known until the surgery has actually been completed. Furthermore, disruptions such as equipment failure or the arrival of a non-elective surgery can occur simultaneously. Thus, the assignment of surgeries needs to be updated, as and when disruptions occur, to minimize their effects. In this paper, we present a stochastic dynamic programming approach to the surgery allocation problem with multiple operating rooms under uncertainty. Given an elective list for the day, the dy-namic optimization model minimizes the number of surgeries not carried out by the end of the shift and the total waiting times of patients during the day weighted according to their urgency level. Due to the curse of dimensionality, we apply an approximate dynamic programming algorithm to solve the stochastic dynamic surgery management model. Computational experiments are designed to demonstrate the performance of the proposed algorithm and its applicability to practical settings. The results show that the approximate dynamic programming algorithm provides a good approximation to the optimum policy and leads to some managerial insights. (c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Reactive scheduling
Uncertainty modelling
Surgery management
Approximate dynamic programming
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏A two-level optimization model for elective surgery scheduling with downstream capacity constraints
OAAI
OAAI分享收藏
查看更多内容