Homecare staff scheduling with three-step algorithm

This paper introduces a three-step algorithm, an efficient framework for solving a homecare staff scheduling problem (HSSP) service schedule, a multi-objective problem requiring a combination of the VRP and the staff scheduling problem. The proposed scheduling technique takes account of the design of optimal daily service routes and the dispatch of caregivers to visit patients under time and capacity constraints. The framework consists of three major stages: Step 1) Route scheduling creates effective routes for homecare caregivers to service patients at different task locations with the shortest path. Step 2) Resource selection seeks to match qualified staff to each route with the minimum cost and preferences under possible time, qualification requirement constraints, and modes of transportation. Step 3) Local improvement enhances the output solution generated by the resource selection by swapping tasks based on the cost function. Our empirical study reveals that the proposed scheduling technique can explore the improved service plan for an adapted case study with the minimum service cost and highest efficiency for arranging service tasks compared to the manual procedure.