Cargando…
Staff scheduling for residential care under pandemic conditions: The case of COVID-19
The COVID-19 pandemic severely impacted residential care delivery all around the world. This study investigates the current scheduling methods in residential care facilities in order to enhance them for pandemic conditions. We first define the basic problem that addresses decisions associated with t...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier Ltd.
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9065499/ https://www.ncbi.nlm.nih.gov/pubmed/35530747 http://dx.doi.org/10.1016/j.omega.2022.102671 |
Sumario: | The COVID-19 pandemic severely impacted residential care delivery all around the world. This study investigates the current scheduling methods in residential care facilities in order to enhance them for pandemic conditions. We first define the basic problem that addresses decisions associated with the assignment and scheduling of staff members, who perform a set of tasks required by residents during a planning horizon. This problem includes the minimization of costs associated with the salary of part-time staff members, total overtime, and violations of service time windows. Subsequently, we adapt the basic problem to pandemic conditions by considering the impacts of communal spaces (e.g., shared rooms) and a cohorting policy (classification of residents based on their risk of infection) on the spread of infectious diseases. We introduce a new objective function that minimizes the number of distinct staff members serving each room of residents. Likewise, we propose a new objective function for the cohorting policy that aims to minimize the number of distinct cohorts served by each staff member. A new constraint is incorporated that forces staff members to serve only one cohort within a shift. We present a population-based heuristic algorithm to solve this problem. Through a comparison with two benchmark solution approaches (a mathematical programme and a non-dominated archiving ant colony optimization algorithm), the superiority of the heuristic algorithm is shown regarding solution quality and CPU time. Finally, we conduct numerical analyses to present managerial implications. |
---|