Hospitals need to repeatedly produce duty rosters for its nursing staff. The good scheduling of nurses has impact on the quality of health care, the recruitment of nurses, the development of budgets and other nursing functions. The nurse rostering problem (NRP) has been the subject of much study. This paper presents a brief overview, in the form of a bibliographic survey, of the many models and...

Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...

Population-based approaches regularly are better than single based (local search) in exploring the search space. However, drawback of population-based is exploiting Several hybrid have proven their efficiency through different domains optimization problems by incorporating and integrating strength population local approaches. Meanwhile, methods a increasing parameter tuning. Recently, was propo...

One intricate computational problem still researched today is the Nurse Rostering Problem. Most literature presents different solutions to the local problem, but in recent years the concept of problem decomposition was identified as one way to improve performance. The downside of this is that the quality of separate rosters is much lower than that of a central solution, where personnel can be s...

Constructing timetables of work for personnel in healthcare institutions is known to be a highly constrained and difficult problem to solve. In this thesis, we introduce a model for the practical rostering problem in Belgian hospitals. It is general enough to cope with the large set of constraints and to meet varying objectives encountered in practice. We set up a solution framework that consis...

Some experiments on randomly generated partial constraint satisfaction problems as well as an example from the domain of real world nurse rostering illustrate the advantage of the cyclecutset method as a repair step in iterative search. These results motivate the integration of adopted algorithms on solving tree-structured constraint problems and the cycle-cutset method into modern constraint-b...

In this paper we present a novel Case-Based Reasoning (CBR) system called CABAROST (CAsed-BAsed ROSTering) which was developed for personnel scheduling problems. CBR is used to capture and store examples of personnel manager behaviour which are then used to solve future problems. Previous examples of constraint violations in schedules and the repairs that were used to solve the violations are s...