A column generation approach for solving the patient admission scheduling problem |
| |
Authors: | Troels Martin Range Richard Martin Lusby Jesper Larsen |
| |
Institution: | 1. Department of Business & Economics, COHERE, University of Southern Denmark, Campusvej 55, 5230 Odense M, Denmark;2. Department of Management Engineering, Technical University of Denmark, Produktionstorvet, Building 426, 2800 Kgs. Lyngby, Denmark |
| |
Abstract: | 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. |
| |
Keywords: | OR in health services Scheduling Column generation Dynamic constraint aggregation Dual disaggregation Branch and bound |
本文献已被 ScienceDirect 等数据库收录! |
|