Scheduling trainees at a hospital department using a branch-and-price approach

Scheduling trainees (graduate students) is a complicated problem that has to be solved frequently in many hospital departments. We will describe a trainee-scheduling problem encountered in practice (at the ophthalmology department of the university hospital Gasthuisberg, Leuven). In this problem, a department has a number of trainees at its disposal, which assist specialists in their activities (surgery, consultation, etc.). For each trainee one has to schedule the activities in which (s)he will assist during a certain time horizon, usually one year. Typically, this kind of scheduling problem is characterized by four types of constraints: work covering constraints, formation requirements, non-availability constraints and setup restrictions. In this paper, we will describe an exact branch-and-price method to solve the problem to optimality.

[1]  Uwe Aickelin,et al.  Exploiting Problem Structure in a Genetic Algorithm Approach to a Nurse Rostering Problem , 2000, ArXiv.

[2]  Edmund K. Burke,et al.  A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem , 1998, SEAL.

[3]  Laurence A. Wolsey,et al.  An exact algorithm for IP column generation , 1994, Oper. Res. Lett..

[4]  François Vanderbeck,et al.  On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm , 2000, Oper. Res..

[5]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[6]  Michael A. Trick,et al.  Optimal shift scheduling: A branch-and-price approach , 2000 .

[7]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[8]  Georges Weil,et al.  Constraint programming for nurse scheduling , 1995 .

[9]  Erik Demeulemeester,et al.  A branch-and-bound procedure for the multiple resource-constrained project scheduling problem , 1992 .

[10]  Jonathan F. Bard,et al.  Preference scheduling for nurses using column generation , 2005, Eur. J. Oper. Res..

[11]  R. Bellman.  Dynamic programming. , 1957, Science.

[12]  Michela Milano,et al.  Enhancing CLP branch and bound techniques for scheduling problems , 2001, Softw. Pract. Exp..

[13]  Marjan van den AkkerHan.  Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem , 2002 .

[14]  Larry W. Jacobs,et al.  A simulated annealing approach to the cyclic staff-scheduling problem , 1993 .

[15]  Andrés Marzal,et al.  Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison , 1999, WAE.

[16]  Elias Willem Hans,et al.  Resource Loading by Branch-and-Price Techniques , 2001 .

[17]  Averill M. Law,et al.  The art and theory of dynamic programming , 1977 .

[18]  Brigitte Jaumard,et al.  A generalized linear programming model for nurse scheduling , 1996, Eur. J. Oper. Res..

[19]  A. Mason,et al.  A Nested Column Generator for solving Rostering Problems with Integer Programming , 1998 .

[20]  D. Michael Warner,et al.  Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach , 1976, Oper. Res..

[21]  Erik Demeulemeester,et al.  Scheduling trainees at a hospital department , 2003 .

[22]  Han Hoogeveen,et al.  Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem , 2002, INFORMS J. Comput..

[23]  Nicholas Beaumont,et al.  Scheduling staff using mixed integer programming , 1997 .

[24]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[25]  Xin Yao,et al.  Selected papers from the Second Asia-Pacific Conference on Simulated Evolution and Learning on Simulated Evolution and Learning , 1998 .

[26]  Michela Milano,et al.  Enhancing CLP branch and bound techniques for scheduling problems , 2001 .

[27]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..