On the Technician Routing and Scheduling Problem
Abstract
The technician routing and scheduling problem consists in routing and scheduling a crew of technicians in order to attend a set of service requests, subject to skill, tool, and spare part constraints. In this study we propose a formal definition of the problem and present a constructive heuristic and a large neighborhood search optimization algorithm.
Fichier principal
Pillac_MIC11_TRSP_Abs.pdf (40.69 Ko)
Télécharger le fichier
Pillac_MIC11_TRSP_Slides.pdf (1.27 Mo)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other
Loading...