The Field Technician Scheduling Problem with Experience-Dependent Service Times

This research studies the Field Technician Scheduling Problem with Experience-Dependent Service Times (FTSP-EDST), involving three main features: matching maintenance tasks with available technicians, sequencing the tasks, and considering the experience-dependent service times. Given a limited number of technicians, the objective is to maximize the collected profit for servicing tasks. This study formulates the problem as a mixed-integer linear programming model and proposes a Modified Iterated Local Search (MILS) to solve the benchmark problem instances of various sizes. A set of FTSP-EDST instances is generated based on existing publicly accessible data, and MILS is utilized to solve these newly generated instances. Computational results confirm the effectiveness of MILS in solving FTSP-EDST.