A nurse rostering system using constraint programming and redundant modeling

  • Authors:

  • B. M.W. Cheng;J. H.M. Lee;J. C.K. Wu

  • Affiliations:

  • Dept. of Comput. Sci. & Eng., Chinese Univ. of Hong Kong, Shatin, Hong Kong;-;-

  • Venue:
  • IEEE Transactions on Information Technology in Biomedicine
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

The paper describes the design and implementation of a constraint-based nurse rostering system using a redundant modeling approach. Nurse rostering is defined as the process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospital rules and soft nurse preference rules. Moreover, some nurse shift pre-assignments often break the regularity of wanted (or unwanted) shifts and reduce the choices for other unfilled slots. Soft constraints amount to disjunction, which can be modeled as choices in the search space. This approach, although straightforward, incurs overhead in the search of solution. To reduce search time, the authors propose redundant modeling, an effective way to increase constraint propagation through cooperation among different models for the same problem. The problem domain involves around 25 to 28 nurses and 11 shift types. Experiments and pilot testing of the system confirm the effectiveness and efficiency of the method.