An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
This paper presents an investigation into the application of heuristic decomposition and mixed-integer programming to tackle workforce scheduling and routing problems (WSRP) that involve timedependent activities constraints. These constraints refer to time-wise dependencies between activities. The d...
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Published: |
Springer
2017
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/41537/ |