A column generation approach for solving the patient admission scheduling problem

Troels Martin Range, Richard Martin Lusby, Jesper Larsen

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TidsskriftEuropean Journal of Operational Research
Vol/bind235
Udgave nummer1
Sider (fra-til)252–264
ISSN0377-2217
DOI
StatusUdgivet - 16. maj 2014

Fingeraftryk Dyk ned i forskningsemnerne om 'A column generation approach for solving the patient admission scheduling problem'. Sammen danner de et unikt fingeraftryk.

Citationsformater