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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baumgartner, K.M. and B.W. Wah. (1991). “Computer Scheduling Algorithm: Past, Present and Future.” Information Sciences 57/58, 319–345.
Bodin, Lawrence, Bruce Golden, Arjang Assad, and Michael Ball. (1983). “Routing and Scheduling of Vehicles and Crews: The State of the Art.” Computers & Operations Research 10(2), 63–210.
Caseau, Yves and Peter Koppstein. (1992). “A Cooperative-Architecture Expert System for Solving Large Time/Travel Assignment Problems.” In International Conference on Deatabases and Expert Systems Applications, Valencia, Spain.
Feo, T.A. and M. Resende. (1988). “AProbablistic Heuristic for a Computationally Difficult SetCovering Problem.” Operations Research Letter 8, 67–71.
Glover, Fred. (1999). “Scatter Search and Path Relinking.” Corne, Dorigo and Glover (Eds.), In New Methods in Optimization, New York: McGraw-Hill.
Glover, Fred and Manuel Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.
Kontoravdis, George and Jonathan F. Bard. (1995). “A GRASP for the Vehicle Routing Problem with Time Windows.” ORSA Journal on Computing 7(1), 10–23.
Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Ed.). (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. New York: John Wiley & Sons Ltd.
Pinedo, Michael. (1995).Scheduling: Theory, Algorithms, and Systems. New York: Prentice Hall.
Rickel, J. (1988). “Issues in the Design of Scheduling Systems.” In M.D. Oliff (Ed.), Expert Systems and Intelligent Manufacturing. New York: Elsevier, pp. 70–89.
Solomon, Marius M. and Jacques Desrosiers. (1988). “Time Window Constrained Routing and Scheduling Problems.” Transportation Science 22(1), 1–13.
Thompson, Paul M. and Harilaos N. Psaraftis. (1993). “Cyclic Transfer Algorithms for Multivehcile Routine and Scheduling Problems.” Operations Research 41(5), 935–946.
Tsang, E. and C. Voudouris. (1997). “Fast Local Search and Guided Local Search and Their applications to British Telecom's Workforce Scheduling Problem.” Operations Research Letters 20, 119–127.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Xu, J., Chiu, S.Y. Effective Heuristic Procedures for a Field Technician Scheduling Problem. Journal of Heuristics 7, 495–509 (2001). https://doi.org/10.1023/A:1011377929184
Issue Date:
DOI: https://doi.org/10.1023/A:1011377929184