The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies

► A novel optimisation-based heuristic is developed. ► The method utilises clustering of visits. ► Real-life problems are solved with good results. ► Time window branching is used for the first time to enforce generalised precedence constraints for real-life problems.