Effective Heuristic Procedures for a Field Technician Scheduling Problem

Authors:
Jiyang Xu;Steve Y. Chiu
Affiliations:
Qwest Information Technologies, 4001 Discovery Drive, Boulder, CD 80303, USA. jxxu@qwest.com;Genuity Inc., 3 Van de Graaff Drive, Burlington, MA 01803, USA. schiu@genuity.com
Venue:
Journal of Heuristics
Year:
2001

Citing 5
Cited 2

Computer scheduling algorithms: past, present, and future

Information Sciences: an International Journal - Special issue on information sciences—past, present, and future
Cyclic transfer algorithms for multivehicle routing and scheduling problems

Operations Research
Scatter search and path relinking

New ideas in optimization
Tabu Search

Tabu Search
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Scheduling technicians and tasks in a telecommunications company

Journal of Scheduling
Adaptive large neighborhood search for service technician routing and scheduling problems

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a field technician scheduling problem faced by many service providers in telecommunication industry. The problem is to assign a set of jobs, at different locations with time windows, to a group of field technicians with different job skills. Such a problem can be viewed as a generalization of the well-known vehicle routing problem with time windows since technician skills need to be matched with job types. We designed and tested several heuristic procedures for solving the problem, namely a greedy heuristic, a local search algorithm, and a greedy randomized adaptive search procedure (GRASP). Our computational results indicate that GRASP is the most effective among them but requires more CPU time. However, the unique structure of GRASP allows us to exploit parallelism to achieve linear speed-up with respect to the number of machines used.