A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints
(2015)
Conference Proceeding
We present a greedy heuristic (GHI) designed to tackle five time-dependent activities constraints (synchronisation, overlap, minimum difference, maximum difference and minimum-maximum difference) on workforce scheduling and routing problems. These ty... Read More about A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints.