The Field Technician Scheduling Problem with Experience-Dependent Service Times

Vincent F. Yu; Yueh Sheng Lin; Panca Jodiawan; Shih Wei Lin; Yu Chi Lai

doi:10.3390/math11214562

The Field Technician Scheduling Problem with Experience-Dependent Service Times

Vincent F. Yu
, Yueh Sheng Lin
, Panca Jodiawan
, Shih Wei Lin^*
, Yu Chi Lai

^*Corresponding author for this work

National Taiwan University of Science and Technology
Chang Gung University
Chang Gung Memorial Hospital
Ming Chi University of Technology

Research output: Contribution to journal › Journal Article › peer-review

2 Scopus citations

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.

Original language	English
Article number	4562
Journal	Mathematics
Volume	11
Issue number	21
DOIs	https://doi.org/10.3390/math11214562
State	Published - 11 2023
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2023 by the authors.

Keywords

experience-dependent service time
Iterated Local Search
profit maximization
technician routing and scheduling

Access to Document

10.3390/math11214562

Cite this

@article{ff92c6f1e3d0430fad5bc19e12fd7dac,

title = "The Field Technician Scheduling Problem with Experience-Dependent Service Times",

abstract = "This research studies the Field Technician Scheduling Problem with Experience-Dependent Service Times (FTSP{\textendash}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{\textendash}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{\textendash}EDST.",

keywords = "experience-dependent service time, Iterated Local Search, profit maximization, technician routing and scheduling",

author = "Yu, \{Vincent F.\} and Lin, \{Yueh Sheng\} and Panca Jodiawan and Lin, \{Shih Wei\} and Lai, \{Yu Chi\}",

note = "Publisher Copyright: {\textcopyright} 2023 by the authors.",

year = "2023",

month = nov,

doi = "10.3390/math11214562",

language = "英语",

volume = "11",

journal = "Mathematics",

issn = "2227-7390",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "21",

}

TY - JOUR

T1 - The Field Technician Scheduling Problem with Experience-Dependent Service Times

AU - Yu, Vincent F.

AU - Lin, Yueh Sheng

AU - Jodiawan, Panca

AU - Lin, Shih Wei

AU - Lai, Yu Chi

PY - 2023/11

Y1 - 2023/11

N2 - 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.

AB - 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.

KW - experience-dependent service time

KW - Iterated Local Search

KW - profit maximization

KW - technician routing and scheduling

UR - https://www.scopus.com/pages/publications/85176585219

U2 - 10.3390/math11214562

DO - 10.3390/math11214562

M3 - 文章

AN - SCOPUS:85176585219

SN - 2227-7390

VL - 11

JO - Mathematics

JF - Mathematics

IS - 21

M1 - 4562

ER -

The Field Technician Scheduling Problem with Experience-Dependent Service Times

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this