Author(s): Oliveira, Márcia ; Rocha, Ana Maria A. C. ; Alves, Filipe
Date: 2024
Persistent ID: https://hdl.handle.net/1822/95920
Origin: RepositóriUM - Universidade do Minho
Subject(s): Constrained optimization; Google OR-Tools; Nurse scheduling problem
Scheduling of employees is a common problem that can be found in most organizations all over the world. One example is the nurse scheduling problem (NSP), which is a complex combinatorial opti-mization problem faced by healthcare institutions in assigning working and nonworking days. The NSP comprises constraints for the nurses, for the hospital and considers specific labor regulations, as well as the skills and preferences of workers. In summary, it involves hard and soft constraints. It is essential to create a quality timetable that can lead to a more contented and thus, more effec-tive and productive workforce. To improve this process, it can be used automated approaches and techniques. In this study, a litera-ture review about the nurse scheduling problem and how to use the Google OR-Tools software to solve it is performed. Moreover, an example of an NSP involving 10 nurses being assigned to three shifts a day, seven days a week is presented. Some condi-tions/constraints have been added in order to reproduce a real situation.
