Mixed integer programming with decomposition to solve a workforce scheduling and routing problem
We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. This problem arises from a number of home care p...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scipress
2015
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31297/ |