Abstract
The Technicians and Interventions Scheduling Problem for Telecommunications embeds the scheduling of interventions, the assignment of teams to interventions and the assignment of technicians to teams. Every intervention is characterized, among other attributes, by a priority. The objective of this problem is to schedule interventions such that the interventions with the highest priority are scheduled at the earliest time possible while satisfying a set of constraints like the precedence between some interventions and the minimum number of technicians needed with the required skill levels for the intervention. We present a Greedy Randomized Adaptive Search Procedure (GRASP) for solving this problem. In the proposed implementation, we integrate learning to the GRASP framework in order to generate good-quality solutions using information brought by previous ones. We also compute lower bounds and present experimental results that validate the effectiveness of this approach.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Atkinson, J. B. (1998). A greedy randomized search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy. Journal of the Operational Research Society, 49, 700–708.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to algorithms (2nd ed.). Cambridge: MIT.
Dutot, P.-F., & Laugier, A. (2005). Technicians and interventions scheduling for telecommunications (ROADEF challenge subject). Technical report, France Telecom R&D.
Festa, P., & Resende, M. G. C. (2002). GRASP: An annotated bibliography. In C. C. Ribeiro & P. Hansen (Eds.), Essays and surveys in metaheuristics (pp. 325–367). Dordrecht: Kluwer.
Fleurent, C., & Glover, F. (1999). Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11, 198–204.
Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer.
Lodi, A., Martello, S., & Vigo, D. (2004). Models and bounds for two-dimensional level packing problems. Journal of Combinatorial Optimization, 8, 363–379.
Pitsoulis, L., & Resende, M. (2001). Greedy randomized adaptive search procedures. Technical report, AT&T Labs Research.
Resende, M. G. C., & Ribeiro, C. C. (1997). A GRASP for graph planarization. Networks, 29, 173–189.
Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomized adaptive search procedures. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219–249). Dordrecht: Kluwer.
Taillard, É. D., Gambardella, L. M., Gendreau, M., & Potvin, J.-Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135, 1–16.
Xu, J., & Chiu, S. Y. (2001). Effective heuristic procedures for a field technician scheduling problem. Journal of Heuristics, 7, 495–509.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hashimoto, H., Boussier, S., Vasquez, M. et al. A GRASP-based approach for technicians and interventions scheduling for telecommunications. Ann Oper Res 183, 143–161 (2011). https://doi.org/10.1007/s10479-009-0545-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0545-0