Computational study for workforce scheduling and routing problems
We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from th...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scipress
2014
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31326/ |