A Successful Three-Phase Metaheuristic for the Shift Minimization Personal Task Scheduling Problem. (29th January 2021)

• Record Type: Journal Article
• Authors: Nurmi, Kimmo; Kyngäs, Nico
• Other Names: Repoussis Panagiotis P. Academic Editor.
• Is Part Of: Advances in operations research. Volume 2021(2021)
• Publication Date: 2021-01-29
• Subjects: Operations research -- Periodicals; Operations research; Periodicals; 003
• DOI: 10.1155/2021/8876990
• Languages: English
• ISSNs: 1687-9147

Abstract

Abstract : Workforce scheduling process consists of three major phases: workload prediction, shift generation, and staff rostering. Shift generation is the process of transforming the determined workload into shifts as accurately as possible. The Shift Minimization Personnel Task Scheduling Problem (SMPTSP) is a problem in which a set of tasks with fixed start and finish times must be allocated to a heterogeneous workforce. We show that the presented three-phase metaheuristic can successfully solve the most challenging SMPTSP benchmark instances. The metaheuristic was able to solve 44 of the 47 instances to optimality. The metaheuristic produced the best overall results compared to the previously published methods. The results were generated as a by-product when solving a more complicated General Task-based Shift Generation Problem. The metaheuristic generated comparable results to the methods using commercial MILP solvers as part of the solution process. The presented method is suitable for application in large real-world scenarios. Application areas include cleaning, home care, guarding, manufacturing, and delivery of goods.