A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints
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 types of constraints are important because they allo...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scipress
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31294/ |