A constraint-based nurse rostering system using a redundant modeling approach

Abstract

This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a 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 tree. This approach, although straightforward, incurs overhead in the search of solution. We propose redundant modeling, an effective way to speed up constraint propagation through cooperations among different models for the same problem, as a means to reduce search time. Experiments and pilot testing of the system confirm the feasibility of our method.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 32 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.