Article ID Journal Published Year Pages File Type
6898591 European Journal of Operational Research 2012 13 Pages PDF
Abstract
► 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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Preview
The Home Care Crew Scheduling Problem: Preference-based visit clustering and temporal dependencies
Authors
, , , ,