This paper tackles an extension to the Multi-activity Combined Timetabling and Crew Scheduling Problem (MCTCSP).The goal of the original problem is to schedule the minimum number of homogenous workers required, in order to visit a set of customers characterized by services needed against schedule availability.However, since in home services it is common to have specialized workers, a mathematical model considering a heterogeneous workforce is proposed.As a solution, a GRASP-based algorithm is designed.In order to test the metaheuristic performance, 110 instances from the literature are adapted to include categorical skills.In addition, another 10 instances are randomly generated to consider large problems.The results show that the proposed GRASP finds optimal solutions in 46% of the cases and saves 40-96% computational time.