Mixed integer programming with decomposition for workforce scheduling and routing with time-dependent activities constraints
We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2016
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/32122/ |