This paper deals with the Generalised Workforce Scheduling and Routing Problem (GWSRP) where 9 temporal constraints ensuring visit dependencies are all together taken into account and where customer and worker’s quality of service are taken into consideration. A Constraint-Programming based Decomposition Method (CPDM) is proposed, firstly based on a relaxation of coordination constraints and a column generation, and secondly with an iterative insertion of coordination constraint by constraint programming solver. Numerical experiments are achieved on huge instances derived from WSRP benchmark instances with up to 177 customers, 59 vehicles and coordination constraints. The CPDM is able to find nearly optimal solution for medium-size instances and find high-quality solution for huge-size instances whereas CPLEX solver applied to a mixed integer linear model is not able to give a solution in this case.

本文处理广义劳动力调度和路由问题 (GWSRP)，其中考虑了确保访问依赖关系的 9 个时间约束，并考虑了客户和工人的服务质量。提出了一种基于约束规划的分解方法（CPDM），首先基于放松协调约束和列生成，其次通过约束规划求解器迭代插入协调约束。数值实验是在源自 WSRP 基准实例的大型实例上实现的，该实例具有多达 177 个客户、59 辆车辆和协调约束。