Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem

Authors:
Broos Maenhout;Mario Vanhoucke
Affiliations:
Faculty of Economics and Business Administration, Ghent University, Gent, Belgium 9000;Operations & Technology Management Centre, Vlerick Leuven Gent Management School, Gent, Belgium 9000
Venue:
Journal of Scheduling
Year:
2010

Citing 11
Cited 2

Improving the dispersion of surplus labor in personnel scheduling solutions

Computers and Industrial Engineering
An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations

Computers and Operations Research
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
A Column Generation Approach for Large-Scale Aircrew Rostering Problems

Operations Research
The Assignment Problem with Seniority and Job Priority Constraints

Operations Research
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem

INFORMS Journal on Computing
Variable neighborhood search for nurse rostering problems

Metaheuristics
The State of the Art of Nurse Rostering

Journal of Scheduling
A 0-1 goal programming model for nurse scheduling

Computers and Operations Research
An exact algorithm for IP column generation

Operations Research Letters

An evolutionary approach for the nurse rerostering problem

Computers and Operations Research
Integrated staffing and scheduling for an aircraft line maintenance problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The efficient management of nursing personnel is of critical importance in a hospital's environment comprising a vast share of the hospital's operational costs. The nurse scheduling process affects highly the nurses' working conditions, which are strongly related to the provided quality of care. In this paper, we consider the rostering over a mid-term period that involves the construction of duty timetables for a set of heterogeneous nurses. In scheduling nursing personnel, the head nurse is typically confronted with various (conflicting) goals complying with different priority levels which represent the hospital's policies and the nurses' preferences. In constructing a nurse roster, nurses need to be assigned to shifts in order to maximize the quality of the constructed timetable satisfying the case-specific time related constraints imposed on the individual nurse schedules. Personnel rostering in healthcare institutions is a highly constrained and difficult problem to solve and is known to be NP-hard. In this paper, we present an exact branch-and-price algorithm for solving the nurse scheduling problem incorporating multiple objectives and discuss different branching and pruning strategies. Detailed computational results are presented comparing the proposed branching strategies and indicating the beneficial effect of various principles encouraging computational efficiency.