Tree clustering for constraint networks (research note)
Artificial Intelligence
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Lisp and Symbolic Computation
On the conversion between non-binary constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Encodings of non-binary constraint satisfaction problems
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
Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
DIMACS workshop on on Constraint programming and large scale discrete optimization
The State of the Art of Nurse Rostering
Journal of Scheduling
Finding good nurse duty schedules: a case study
Journal of Scheduling
Memes, self-generation and nurse rostering
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Solving nurse rostering problems using soft global constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
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
Memetic algorithms for nurse rostering
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Hi-index | 0.00 |
This paper presents a hybrid AI approach for a class of overconstrained Nurse Rostering Problems. Our approach comes in two phases. The first phase solves a relaxed version of problem which only includes hard rules and part of nurses' requests for shifts. This involves using a forward checking algorithm with non-binary constraint propagation, variable ordering, random value ordering and compulsory backjumping. In the second phase, adjustments with descend local search and tabu search are applied to improved the solution. This is to satisfy the preference rules as far as possible. Experiments show that our approach is able to solve this class of problems well.