The Field Technician Scheduling Problem with Experience-Dependent Service Times-Reference-Cited by-同舟云学术

The Field Technician Scheduling Problem with Experience-Dependent Service Times

Published:2023-11-06 Issue:21 Volume:11 Page:4562
ISSN:2227-7390
Container-title:Mathematics
language:en
Short-container-title:Mathematics

Author:

Yu Vincent F.¹^ORCID,Lin Yueh-Sheng¹^ORCID,Jodiawan Panca¹,Lin Shih-Wei²³⁴^ORCID,Lai Yu-Chi⁵^ORCID

Affiliation:

1. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan

2. Department of Information Management, Chang Gung University, Taoyuan 333, Taiwan

3. Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 205, Taiwan

4. Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei 243, Taiwan

5. Department of Computer Science and Information Engineering, National Taiwan University of Science and Technology, Taipei 106, Taiwan

Abstract

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.

Funder

Ministry of Science and Technology of the Republic of China

Chang Gung Memorial Hospital

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Link

https://www.mdpi.com/2227-7390/11/21/4562/pdf

Reference33 articles.

1. Dutot, P.F., Laugier, A., and Bustos, A.M. (2006). Technicians and Interventions Scheduling for Telecommunications, France Telecom R&D.

2. Toth, P., and Vigo, D. (2014). Vehicle Routing: Problems, Methods, and Applications, SIAM. [2nd ed.].

3. A biased random key genetic algorithm for the field technician scheduling problem;Damm;Comput. Oper. Res.,2016

4. The technician routing problem with experience-based service times;Chen;Omega,2016

5. Villegas, J., Guéret, C., Mendoza, J.E., and Montoya, A. (2018). The Technician Routing and Scheduling Problem with Conventional and Electric Vehicle, HAL.