A column generation approach for solving the patient admission scheduling problem
This paper addresses the Patient Admission Scheduling (PAS) problem. The PAS problem deals with assigning elective patients to beds, satisfying a number of soft and hard constraints. The problem can be seen as part of the functions of hospital management at an operational level. There exists a small number of different variants on this problem. We propose an optimization-based heuristic building on branch-and-bound, column generation, and dynamic constraint aggregation for one of the variants. We achieve tighter bounds than previously reported in the literature, and in addition we are able to produce new best solutions for five out of six instances from a publicly available repository.
|Date of creation:||09 Jan 2013|
|Date of revision:|
|Contact details of provider:|| Postal: Department of Business and Economics, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark|
Phone: 65 50 32 33
Fax: 65 50 32 37
Web page: http://www.sdu.dk/ivoe
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- R Lusby & A Dohn & T M Range & J Larsen, 2012. "A column generation-based heuristic for rostering with work patterns," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(2), pages 261-277, February.
When requesting a correction, please mention this item's handle: RePEc:hhs:sdueko:2013_001. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lene Holbæk)
If references are entirely missing, you can add them using this form.