k-Traveling Repairmen Problem, with multiple repairmen visiting the same job lowering service time

Question

For my Thesis, I want to create an algorithm that optimizes the k-Traveling Repairmen Problem, with the extension that sending multiple repairmen to the same location lowers the