A Column Generation Approach for Solving the Patient Admission Scheduling Problem

  • Range T
  • Lusby R
  • Larsen J
  • 1


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


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 dierent 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 ve out of six instances from a publicly available repository.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Troels Martin Range

  • Richard Martin Lusby

  • Jesper Larsen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free