期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 235, 期 1, 页码 252-264出版社
ELSEVIER
DOI: 10.1016/j.ejor.2013.10.050
关键词
OR in health services; Scheduling; Column generation; Dynamic constraint aggregation; Dual disaggregation; Branch and bound
This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem entails assigning elective patients to beds, while satisfying a number of hard constraints and as many soft constraints as is possible, and arises at all planning levels for hospital management. There exist a few, different variants of this problem. In this paper we consider one such variant and propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic constraint aggregation to solve it. We achieve tighter lower bounds than previously reported in the literature and, in addition, we are able to produce new best known solutions for five out of twelve instances from a publicly available repository. (C) 2013 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据