This paper addresses sustainable workforce scheduling and routing problem (WSRP), in which technicians with different levels of competence are paired into teams to serve customers in different geographic regions-districts within predetermined time windows. We formulate the WSRP as a mixed integer linear programming formulation that covers the decisions such as scheduling, routing, state of charge, and visiting of the charging stations. Furthermore, we developed different objective functions minimizing not only total travelled distance, but also the number of electrical vehicles employed. The performance of the proposed heuristic is tested by using real-world data. In addition, the developed variable neighbourhood search algorithm is compared with the exact solution method and the computational results indicates that the proposed heuristic can yield high quality of solutions. [ABSTRACT FROM AUTHOR]