.png){kind=icon}
返回
A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2015.02.032.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a model and solution methodology for scheduling patients in a multi-class, multi-resource surgical system. Specifically, given a master schedule that provides a cyclic breakdown of total OR availability into specific daily allocations to each surgical specialty, the model provides a scheduling policy for all surgeries that minimizes a combination of the lead time between patient request and surgery date, overtime in the operating room and congestion in the wards. To the best of our knowledge, this paper is the first to determine a surgical schedule based on making efficient use of both the operating rooms and the recovery beds. Such a problem can be formulated as Markov Decision Process model but the size of any realistic problem makes traditional solution methods intractable. We develop a version of the Least Squares Approximate Policy Iteration algorithm and test our model on data from a local hospital to demonstrate the success of the resulting policy. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Health care
Dynamic programming
Markov decision processes
Surgical scheduling
Simulation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
The Perils and Pitfalls of Performance Measurement: The CPA Regime for Local Authorities in England
PREAI
分享收藏Modeling the uncertainty of surgical procedure times - Comparison of log-normal and normal models.png)
ANESTHESIOLOGYOAAI
ANESTHESIOLOGYIF9.1
OAAI分享收藏分享收藏
查看更多内容