Skip to main content

Technician Routing and Scheduling Problem: A Case Study

  • Conference paper
  • First Online:
Quality Innovation and Sustainability (ICQUIS 2022)

Part of the book series: Springer Proceedings in Business and Economics ((SPBE))

Included in the following conference series:

  • 581 Accesses

Abstract

The problem of routing and scheduling of technicians is a problem that technical assistance and maintenance companies face nowadays, market competitiveness requires quick response, service diversification, and customer satisfaction. The relationship between competitiveness and profitability of companies involves the effective management of their resources. The work developed addresses a real problem of a major Portuguese company providing technical assistance to the home, a varied set of services (need for specific skills and execution times) must be scheduled for a set of technicians with heterogeneous skills and geographical locations (start and end of the route) based on their different places of residence. The results show a considerable increase in the efficiency levels of the solution obtained when compared to the company’s current solution and reveals that the lack of homogeneity of skills among technicians and the variation in service flows are factors that should be considered in the operational management of resources and the contracting of work, and that the increase in working hours can also contribute to improving the efficiency of the process.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Pillac, V., Guéret, C., & Medaglia, A. (2012). On the dynamic technician routing and scheduling problem. Diss. Ecole des Mines de Nantes.

    Google Scholar 

  2. Khalfay, A., Crispin, A., & Crockett, K. (2017). A review of technician and task scheduling problems, datasets and solution approaches. In 2017 intelligent systems conference (IntelliSys) (pp. 288–296). IEEE.

    Google Scholar 

  3. Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1), 3–27.

    Article  Google Scholar 

  4. Pillac, V., Gueret, C., & Medaglia, A. L. (2013). A parallel matheuristic for the technician routing and scheduling problem. Optimization Letters, 7(7), 1525–1535.

    Article  Google Scholar 

  5. Kovacs, A. A., Parragh, S. N., Doerner, K. F., & Hartl, R. F. (2012). Adaptive large neighborhood search for service technician routing and scheduling problems. Journal of Scheduling, 15(5), 579–600.

    Article  Google Scholar 

  6. Cordeau, J. F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunications company. Journal of Scheduling, 13(4), 393–409.

    Article  Google Scholar 

  7. Hashimoto, H., Boussier, S., Vasquez, M., & Wilbaut, C. (2011). A GRASP-based approach for technicians and interventions scheduling for telecommunications. Annals of Operations Research, 183(1), 143–161.

    Article  Google Scholar 

  8. Estellon, B., Gardi, F., & Nouioua, K. (2009). High-performance local search for task scheduling with human resource allocation. In International workshop on engineering stochastic local search algorithms (pp. 1–15). Springer.

    Google Scholar 

  9. Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403–2435.

    Article  Google Scholar 

  10. Lutz, R. (2015). Adaptive large neighborhood search. Bachelor thesis at Ulm University.

    Google Scholar 

  11. TBonfi. GitHub. Obtained in 2021, from GitHub: https://github.com/TBonfi/Haversine-en-excel/blob/master/Haversine-Distancia.bas

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manuel P. Lopes .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Nunes, C., Lopes, M.P. (2023). Technician Routing and Scheduling Problem: A Case Study. In: de Oliveira Matias, J.C., Oliveira Pimentel, C.M., Gonçalves dos Reis, J.C., Costa Martins das Dores, J.M., Santos, G. (eds) Quality Innovation and Sustainability. ICQUIS 2022. Springer Proceedings in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-031-12914-8_30

Download citation

Publish with us

Policies and ethics