Nurse rostering is a complex problem which affects the everyday activities and health care tasks in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. The goal is to find a quality assignment of shift categories to available nurses. Even though solving the Nurse Rostering Problem has been a field of interest o...

The nurse rostering problem presents a combinatorial optimisation problem in which shifts must be assigned to nurses who are subject to a large number of workforce related constraints. In the literature on nurse rostering, the fairness of the constructed rosters has often been neglected. Solutions are typically evaluated by means of a weighted sum objective function which does not explicitly ac...

This paper describes a decision support methodologies for nurse rostering problem in a modern hospital environment. In particular, it is very important to efficiently utilise time and effort, to evenly balance the workload among people and to attempt to satisfy personnel preference. We presented a complete model to formulate all the complex real-world constraints, solution approach and Hybrid a...

This paper considers a real-world rostering problem at the Gold Coast Hospital, Queensland. Nurse rostering is a constraint satisfaction problem (CSP) [3]. The task is to find a consistent allocation of shift values, for a group of nurses, over a fixed period of time, that satisfy a set of rostering constraints. These constraints include i) acceptable shift combinations (or schedules) for indiv...

This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospit...

It is time-consuming to determine the nurse rostering using traditional human-involved manner in order to account for administrative operations, business benefits, governmental regulations, and nurse requests. Moreover, the objectives cannot be measured quantitatively even when the nurse rostering is generated after a lengthy manual process. This paper presents a multiobjective optimization met...

Nurse rostering is a well-known highly constrained scheduling problem requiring assignment of shifts to nurses satisfying a variety of constraints. Exact algorithms may fail to produce high quality solutions, hence (meta)heuristics are commonly preferred as solution methods which are often designed and tuned for specific (group of) problem instances. Hyper-heuristics have emerged as general sea...

Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic...

This paper presents a general optimisation-based rostering engine developed by the University of Auckland. This engine is designed to solve a wide range of personnel scheduling (staff rostering) problems. The engine is currently being used to roster over 700 staff at an Australian call centre and also for the rostering of 50 immigration staff at Auckland International Airport. It is being trial...