Proceedings of the eighth biennial conference of the Canadian Society for Computational Studies of Intelligence on CSCSI-90
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Lisp and Symbolic Computation
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
KI '97 Proceedings of the 21st Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
A general backtrack algorithm that eliminates most redundant tests
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A two-stage modeling with genetic algorithms for the nurse scheduling problem
Expert Systems with Applications: An International Journal
Examination timetabling with fuzzy constraints
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A Time Predefined Variable Depth Search for Nurse Rostering
INFORMS Journal on Computing
| Hi-index | 0.00 |
Based on experiences with the ORBIS Dienstplan system [12] - a nurse rostering system that is currently used in about 60 German hospitals - this paper describes how to use constraint processing for automatic rostering. In practice, nurse rostering problems have many varying parameters: working time accounts, demands on crew attendance, set of used shifts, working time models, etc. Hence, rostering requires a flexible formalism for representing the variants of the problem as well as a robust search procedure that is able to cope with all problem instances. The described approach differs in mainly two points from other constraint-based approaches [1], [22] to rostering. On the one hand, the used constraint formalism allows the integration of fine-grained optimization tasks by fuzzy constraints, which a roster may partially satisfy and partially violate. Such constraints have been used to optimize the amount of working time and the presence on the ward. In contrast, traditional frameworks for constraint processing consider only crisp constraints which are either completely violated or satisfied. On the other hand, the described system uses an any-time algorithm to search for good rosters. The traditional constraint-based approach for solving optimization tasks is to use extensions of the branch&bound. Unfortunately, performance of tree search algorithms is very sensitive to even minor changes in the problem representation. Therefore, ORBIS Dienstplan integrates the branch&bound into local search. The branch&bound is used to enable the optimization of more than one variable assignment within one improvement step. This search algorithm converges quickly on good rosters and, additionally, enables a more natural integration of user interaction.