Neural combinatorial optimization has proven effective in solving various simple routing problems including the traveling salesperson problem and the vehicle routing problem (VRP). However, real-world routing scenarios are usually significantly more complex, often requiring sophisticated methods to find even a single feasible solution. In this work, we apply neural combinatorial optimization to the more challenging skill VRP, where routes must be constructed for technicians with diverse skill sets while adhering to customer time windows. Due to the limited number of available technicians, finding feasible solutions is usually very challenging. We evaluate several state-of-the-art learning-based approaches on the skill VRP and explore different reward shaping techniques to penalize infeasible solutions during training. Our findings show that while most approaches can effectively solve instances with 20 customers, all approaches struggle to reliably find feasible solutions for instances with 50 customers.