期刊
ANNALS OF OPERATIONS RESEARCH
卷 239, 期 1, 页码 253-271出版社
SPRINGER
DOI: 10.1007/s10479-013-1478-1
关键词
Patient assignment problem; Dynamic planning; Mixed Integer Linear Programming
资金
- Ph.D. grant of the Agency for Innovation by Science and Technology (IWT)
The present paper studies patient-to-room assignment planning in a dynamic context. To this end, an extension of the patient assignment (PA) problem formulation is proposed, for which two online ILP-models are developed. The first model targets the optimal assignment for newly arrived patients, whereas the second also considers future, but planned, arrivals. Both models are compared on an existing set of benchmark instances from the PA planning problem, which serves as the basic problem setting. These instances are then extended with additional parameters to study the effect of uncertainty on the patients' length of stay, as well as the effect of the percentage of emergency patients. The results show that the second model provides better results under all conditions, while still being computationally tractable. Moreover, the results show that pro-actively transferring patients from one room to another is not necessarily beneficial.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据