Local search and lower bounds for the patient admission scheduling problem

被引:67
作者
Ceschia, Sara [1 ]
Schaerf, Andrea [1 ]
机构
[1] Univ Udine, DIEGM, I-33100 Udine, Italy
关键词
Local search; Simulated annealing; Lower bounds; Healthcare; BED ALLOCATION; OPTIMIZATION; MANAGEMENT; EFFICIENT; TIME;
D O I
10.1016/j.cor.2011.01.007
中图分类号
TP39 [计算机的应用];
学科分类号
080201 [机械制造及其自动化];
摘要
We propose a multi-neighborhood local search procedure to solve a healthcare problem, known as the Patient Admission Scheduling problem. We design and experiment with different combinations of neighborhoods, showing that they have diverse effectiveness for different sets of weights of the cost components that constitute the objective function. We also compute many lower bounds based on the relaxation of some constraints. The outcome is that our results compare favorably with the previous work on the problem, improving all available instances, and in some cases are also quite close to the lower bounds. Finally, we propose the application of the technique to the dynamic case, in which admission and discharge dates are not predictable in advance. (c) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1452 / 1463
页数:12
相关论文
共 44 条
[1]
AARTS E.H.L., 1997, LOCAL SEARCH COMBINA
[2]
[Anonymous], 2006, J MATH MODELLING ALG
[3]
[Anonymous], 2005, Stochastic local search-Foundations and applications
[4]
[Anonymous], NOLH DESIGNS SPREADS
[5]
Bilgin B., 2008, HYPERHEURISTIC APPRO
[6]
BIRATTARI M, 2005, RACE PACKAGE
[7]
Operating room managers' use of integer programming for assigning block time to surgical groups: A case study [J].
Blake, JT ;
Dexter, F ;
Donald, J .
ANESTHESIA AND ANALGESIA, 2002, 94 (01) :143-148
[8]
Brandeau ML., 2004, Operations Research and Health Care: A Handbook of Methods and Applications
[9]
The state of the art of nurse rostering [J].
Burke, EK ;
De Causmaecker, P ;
Vanden Berghe, G ;
Van Landeghem, H .
JOURNAL OF SCHEDULING, 2004, 7 (06) :441-499