A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size.

We present a practical approach to personnel scheduling problems arising in hospital units with demand that is of an urgent nature, cannot be backlogged, and is highly dependent on the time of day. A simple rounding heuristic is combined with a simulated annealing algorithm to obtain near-optimal solutions to large linear integer programming models of these personnel scheduling problems in a reasonable amount of time on a personal computer. The models are designed to complement the current state-of-the-art of commercially available hospital staff scheduling systems.