...
首页> 外文期刊>Manufacturing and service operations management >Inpatient Overflow: An Approximate Dynamic Programming Approach
【24h】

Inpatient Overflow: An Approximate Dynamic Programming Approach

机译:住院病人溢出:一种近似的动态编程方法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Problem definition: Inpatient beds are usually grouped into several wards, and each ward is assigned to serve patients from certain "primary" specialties. However, when a patient waits excessively long before a primary bed becomes available, hospital managers have the option to assign her to a nonprimary bed. although it is undesirable. Deciding when to use such "overflow" is difficult in real time and under uncertainty. Relevance: To aid the decision making, we model hospital inpatient flow as a multiclass, multipool parallel-server queueing system and formulate the overflow decision problem as a discrete-time, infinite-horizon average cost Markov decision process (MDP). The MDP incorporates many realistic and important features such as patient arrival and discharge patterns depending on time of day. Methodology: To overcome the curse-of-dimensionality of this formulated MDP, we resort to approximate dynamic programming (ADP). A critical part in designing an ADP algorithm is to choose appropriate basis functions to approximate the relative value function. Using a novel combination of fluid control and single-pool approximation, we develop analytical forms to approximate the relative value functions at midnight, which then guides the choice of the basis functions for all other times of day. Results: We demonstrate, via numerical experiments in realistic hospital settings, that our proposed ADP algorithm is remarkably effective in finding good overflow policies. These ADP policies can significantly improve system performance over some commonly used overflow strategies-for example, in a baseline scenario, the ADP policy achieves a congestion level similar to that achieved by a complete bed sharing policy, while reduces the overflow proportion by 20%. Managerial implications: We quantify the trade-off between the overflow proportion and congestion from implementing ADP policies under a variety of system conditions and generate useful insights. The plotted efficient frontiers allow managers to observe various performance measures in different parameter regimes, and the ADP policies provide managers with operational strategies to achieve the desired performance.
机译:问题定义:住院床位通常分为几个病房,每个病房分配给某些“主要”专科患者。但是,当患者在获得第一张床之前等待了太长时间时,医院管理人员可以选择将她分配给一张非第一张床。尽管这是不可取的。实时和不确定性决定何时使用这种“溢出”是困难的。相关性:为帮助决策,我们将医院住院病人流量建模为多类,多池并行服务器排队系统,并将溢出决策问题表述为离散时间,无限水平平均成本马尔可夫决策过程(MDP)。 MDP结合了许多现实而重要的功能,例如根据一天中的不同时间到达和出院的方式。方法:为了克服此制定的MDP的维度诅咒,我们求助于近似动态编程(ADP)。设计ADP算法的关键部分是选择合适的基函数来近似相对值函数。通过使用流体控制和单池逼近的新颖组合,我们开发了分析形式来逼近午夜的相对值函数,然后为一天中所有其他时间的基础函数选择提供指导。结果:通过在实际医院环境中进行的数值实验,我们证明了我们提出的ADP算法在找到良好的溢出策略方面非常有效。这些ADP策略可以通过一些常用的溢出策略显着提高系统性能-例如,在基准方案中,ADP策略达到的拥塞级别与完整床共享策略所达到的拥塞级别相似,同时将溢出比例降低20%。对管理的影响:在各种系统条件下,我们通过实施ADP策略来量化溢出比例和拥塞之间的权衡,并产生有用的见解。所绘制的有效边界使管理人员能够观察不同参数体制下的各种绩效指标,而ADP策略为管理人员提供了实现所需绩效的运营策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号