A column generation approach for solving the patient admission scheduling problem

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.

[1]  Jesper Larsen,et al.  A column generation-based heuristic for rostering with work patterns , 2012, J. Oper. Res. Soc..

[2]  Peter A. N. Bosman,et al.  Agent-based patient admission scheduling in hospitals , 2008, AAMAS.

[3]  Phongchai Jittamai,et al.  A hospital admission planning model for emergency and elective patients under stochastic resource requirements and no-shows , 2011, 2011 IEEE International Conference on Industrial Engineering and Engineering Management.

[4]  Jesper Larsen,et al.  Solving the selective multi-category parallel-servicing problem , 2013, Journal of Scheduling.

[5]  Guy Desaulniers,et al.  Multi-phase dynamic constraint aggregation for set partitioning type problems , 2010, Math. Program..

[6]  Guy Desaulniers,et al.  An Improved Primal Simplex Algorithm for Degenerate Linear Programs , 2007, INFORMS J. Comput..

[7]  P. Harper.  A Framework for Operational Modelling of Hospital Resources , 2002, Health care management science.

[8]  Rj Rob Kusters,et al.  Modelling resource availability in general hospitals Design and implementation of a decision support model , 1996 .

[9]  F. Guerriero,et al.  Operational research in the management of the operating theatre: a survey , 2011, Health care management science.

[10]  Patrick De Causmaecker,et al.  A hybrid tabu search algorithm for automatically assigning patients to beds , 2010, Artif. Intell. Medicine.

[11]  M. Lübbecke.  Column Generation , 2010 .

[12]  Edmund K. Burke,et al.  The practice and theory of automated timetabling , 2014, Annals of Operations Research.

[13]  Peter Demeester,et al.  One hyper-heuristic approach to two timetabling problems in health care , 2012, J. Heuristics.

[14]  Sara Ceschia,et al.  Local search and lower bounds for the patient admission scheduling problem , 2011, Comput. Oper. Res..

[15]  Guy Desaulniers,et al.  Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..

[16]  Sara Ceschia,et al.  Modeling and solving the dynamic patient admission scheduling problem under uncertainty , 2012, Artif. Intell. Medicine.

[17]  Zhi-hui Zhan,et al.  A genetic algorithm for the optimization of admission scheduling strategy in hospitals , 2010, IEEE Congress on Evolutionary Computation.