Dynamically accepting and scheduling patients for home healthcare

Abstract

The importance of home healthcare is growing rapidly since populations of developed and even developing countries are getting older and the number of hospitals, retirement homes, and medical staff do not increase at the same rate. We consider the Home Healthcare Nurse Scheduling Problem where patients arrive dynamically over time and acceptance and appointment time decisions have to be made as soon as patients arrive. The objective is to maximise the average number of daily visits for a single nurse. For the sake of service continuity, patients have to be visited at the same day and time each week during their episode of care. We propose a new heuristic based on generating several scenarios which include randomly generated and actual requests in the schedule, scheduling new customers with a simple but fast heuristic, and analysing results to decide whether to accept the new patient and at which appointment day/time. We compare our approach with two greedy heuristics from the literature, and empirically demonstrate that it achieves significantly better results compared to these other two methods.