Nurse Scheduling Using Constraint Logic Programming

Abstract

The nurse scheduling problem consists of assigning working shifts to each nurse on each day of a certain period of time. A typical problem comprises 600 to 800 assignments that have to take into account several requirements such as minimal allocation of a station, legal regulations and wishes of the personnel. This planning is a difficult and time-consuming expert task and is still done manually. INTERDIP 1 is an advanced industrial prototype that supports semi-automatic creation of such rosters. Using the artificial intelligence approach, constraint reasoning and constraint programming, INTERDIP creates a roster interactively within some minutes instead of by hand some hours. Additionally, it mostly produces better results. INTERDIP was developed in collaboration with Siemens Nixdorf. It was presented at the Systems'98 Computer exhibition in Munich and several companies have inquired to market our system. Introduction Many real-life problems lead to combinatorial search, computatio...

Cite

Text

Abdennadher and Schlenker. "Nurse Scheduling Using Constraint Logic Programming." AAAI Conference on Artificial Intelligence, 1999.

Markdown

[Abdennadher and Schlenker. "Nurse Scheduling Using Constraint Logic Programming." AAAI Conference on Artificial Intelligence, 1999.](https://mlanthology.org/aaai/1999/abdennadher1999aaai-nurse/)

BibTeX

@inproceedings{abdennadher1999aaai-nurse,
  title     = {{Nurse Scheduling Using Constraint Logic Programming}},
  author    = {Abdennadher, Slim and Schlenker, Hans},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {838-843},
  url       = {https://mlanthology.org/aaai/1999/abdennadher1999aaai-nurse/}
}