The Field Technician Scheduling Problem with Experience-Dependent Service Times
Published 2023 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
The Field Technician Scheduling Problem with Experience-Dependent Service Times
Authors
Keywords
-
Journal
Mathematics
Volume 11, Issue 21, Pages 4562
Publisher
MDPI AG
Online
2023-11-06
DOI
10.3390/math11214562
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Optimization of the technician routing and scheduling problem for a telecommunication industry
- (2022) Ehsan Pourjavad et al. ANNALS OF OPERATIONS RESEARCH
- A simple solution to technician routing and scheduling problem using improved genetic algorithm
- (2022) Engin Pekel SOFT COMPUTING
- Solving technician routing and scheduling problem using improved particle swarm optimization
- (2020) Engin Pekel Soft Computing
- A metaheuristic based on tabu search for solving a technician routing and scheduling problem
- (2020) Ines Mathlouthi et al. COMPUTERS & OPERATIONS RESEARCH
- Selective Discrete Particle Swarm Optimization for the Team Orienteering Problem with Time Windows and Partial Scores
- (2019) Vincent F. Yu et al. COMPUTERS & INDUSTRIAL ENGINEERING
- An iterated local search algorithm for the University Course Timetabling Problem
- (2018) Ting Song et al. APPLIED SOFT COMPUTING
- Team orienteering problem with time windows and time-dependent scores
- (2018) Vincent F. Yu et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Branch-and-price approaches for the Multiperiod Technician Routing and Scheduling Problem
- (2017) Emilio Zamorano et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Well-tuned algorithms for the Team Orienteering Problem with Time Windows
- (2017) Aldy Gunawan et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- A biased random key genetic algorithm for the field technician scheduling problem
- (2016) Ricardo B. Damm et al. COMPUTERS & OPERATIONS RESEARCH
- The technician routing problem with experience-based service times
- (2016) Xi Chen et al. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
- An artificial bee colony algorithm approach for the team orienteering problem with time windows
- (2014) Tunchan Cura COMPUTERS & INDUSTRIAL ENGINEERING
- An iterative three-component heuristic for the team orienteering problem with time windows
- (2013) Qian Hu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- The Team Orienteering Problem with Time Windows: An LP-based Granular Variable Neighborhood Search
- (2012) Nacima Labadie et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- A simulated annealing heuristic for the team orienteering problem with time windows
- (2011) Shih-Wei Lin et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem
- (2011) Puca Huachi Vaz Penna et al. JOURNAL OF HEURISTICS
- Adaptive large neighborhood search for service technician routing and scheduling problems
- (2011) Attila A. Kovacs et al. JOURNAL OF SCHEDULING
- Progress control in iterated local search for nurse rostering
- (2010) E K Burke et al. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
- Iterated local search for the team orienteering problem with time windows
- (2009) Pieter Vansteenwegen et al. COMPUTERS & OPERATIONS RESEARCH
- A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
- (2009) Yuichi Nagata et al. COMPUTERS & OPERATIONS RESEARCH
- Heuristics for the multi-period orienteering problem with multiple time windows
- (2009) Fabien Tricoire et al. COMPUTERS & OPERATIONS RESEARCH
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
- (2008) Xingye Dong et al. COMPUTERS & OPERATIONS RESEARCH
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now