The development of decision support systems acceptable for nurse rostering practitioners still presents a daunting challenge. Building on an existing nurse rostering problem, a set of fairness-based objective functions recently introduced in the literature has been extended. To this end, a generic agentbased cooperative search framework utilising new mechanisms is described, aiming to combine t...

Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community ...

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

Timetabling and rostering research often starts from particular real world problems. The last two decennia have seen a large number of papers discussing cases, models and approaches. This large body of papers does not presently consitute a structured domain that provides guidelines for addressing particular problem instances, nor does it allow identifying gaps where new research is needed. In t...

In home health care (HHC) services, nurses or professional caregivers are dispatched to patients’ homes to provide medical care services, such that each patient can stay at home to be treated periodically. The HHC problem consists of the nurse rostering problem (NRP) and the vehicle routing problem with time windows (VRPTW), both of which are NP-hard problems, which are harder or equal to the h...

Nurse Rostering is a combinatorial problem hard to solve due to its size and complexity. Several real world details that arise in practice make computerized approaches to the problem indispensable. The specifications of the problem that we solve are those defined in the Nurse Rostering Competition INRC2010. In this contribution, we solve the Nurse Rostering Problem by partitioning the original ...

This paper presents an overview of recent advances for the Nurse Rostering Problem (NRP) based on methodological papers published between 2012 to 2021. It provides a comprehensive review latest solution methodologies, particularly computational intelligence (CI) approaches, utilized in benchmark and real-world nurse rostering. The methodologies are systematically categorised (Heuristics, Meta-h...

This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research were applied) tackled manually. The problem basically concerns the assignment of duties to a set of people with different qualifications, work regulations and preferences. Constraint programming and linear programming techniques ...