A nurse scheduling system based on dynamic constraint satisfaction problem

Authors:
Hiromitsu Hattori;Takayuki Ito;Tadachika Ozono;Toramatsu Shintani
Affiliations:
Dept. of Computer Science, University of Liverpool, Liverpool, United Kingdom;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Aichi, Japan;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Aichi, Japan;Graduate School of Engineering, Nagoya Institute of Technology, Nagoya, Aichi, Japan
Venue:
IEA/AIE'2005 Proceedings of the 18th international conference on Innovations in Applied Artificial Intelligence
Year:
2005

Citing 3
Cited 1

Solution reuse in dynamic constraint satisfaction problems

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Nurse scheduling using constraint logic programming

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Hard, flexible and dynamic constraint satisfaction

The Knowledge Engineering Review

A hybrid approach for solving real-world nurse rostering problems

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we describe a new nurse scheduling system based on the framework of Constraint Satisfaction Problem (CSP). In the system, we must deal with dynamic changes to scheduling problem and with constraints that have different levels of importance. We describe the dynamic scheduling problem as a Dynamic Weighted Maximal CSP (DW-MaxCSP) in which constraints can be changed dynamically. It is usually undesirable to drastically modify the previous schedule in the re-scheduling process. A new schedule should be as close to as possible to the previous one. To obtain stable solutions, we propose methodology for keeping similarity to the previous schedule by using provisional constraints that explicitly penalize changes from the previous schedule. We have confirmed the efficacy of our system experimentally.