Nurse Scheduling Based on Branch- and- Bound Algorithm

The main objective of this study is to search for a scientific method to prepare a weekly schedule for a group of nursing officers working for a ward of a hospital. To achieve this objective, we propose an optimization method. First we develop an optimization model by formulating the objective and the constraints of the problem mathematically. In the recent literatures, a wide variety of different methodologies and models have been developed pertaining to the problem instances. These include Mathematical Programming, Meta-Heuristic Methods and Constraint Satisfaction Techniques. Knowledge Based Techniques have been applied for solving nurse scheduling problem. Column generation was also been explored in nurse scheduling using Set Covering-Type models. Particular optimization model that we are interested in is a 0-1 Integer Linear Programming problem. We apply the Branch-and- Bound technique to solve the problem using the optimization software package LINGO. Finally, the solution to the optimization problem is converted to a regular nurse schedule. The methodology is illustrated by preparing a weekly schedule for a private hospital in Batticaloa, Sri Lanka.