IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v321y2025i3p717-733.html
   My bibliography  Save this article

Scheduling multi-skill technicians and reassignable tasks in a cloud computing company

Author

Listed:
  • Jin, Shuang
  • Tao, Jiaming
  • Lai, Minghui
  • Hu, Qian

Abstract

We investigate a multi-skill technician and reassignable task scheduling problem in a cloud computing company. In the problem, multi-skill technicians are assigned to process a large number of tasks from customer requests in a certain scheduling horizon. The tasks are allowed to be reassigned to another technician multiple times, and one technician can process multiple tasks in parallel. The company not only focuses on processing efficiency, but also expects to improve customers’ experience and technicians’ satisfaction. We characterize the feasible solutions and introduce a weighted objective with three metrics: processing efficiency, response delay, and workload balance. An effective two-stage hierarchical optimization method embedded in a greedy randomized adaptive search procedure framework is proposed. In the first stage, initial solutions are generated by a greedy randomized construction procedure, and then improved by local search with an ejection chain operator to optimize processing efficiency. In the second stage, two local search procedures with five operators for improving response delay or workload balance are designed. Computational experiments are conducted to evaluate the effectiveness of our algorithm. The results show that the proposed algorithm is competent in fast computing a schedule of high quality. It also reveals that reassignments are helpful in reducing response delay and balancing workloads in the scheduling.

Suggested Citation

  • Jin, Shuang & Tao, Jiaming & Lai, Minghui & Hu, Qian, 2025. "Scheduling multi-skill technicians and reassignable tasks in a cloud computing company," European Journal of Operational Research, Elsevier, vol. 321(3), pages 717-733.
    • Handle: RePEc:eee:ejores:v:321:y:2025:i:3:p:717-733
    DOI: 10.1016/j.ejor.2024.09.050
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221724007537
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2024.09.050?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Chen, Xi & Li, Kaiwen & Lin, Sidian & Ding, Xiaosong, 2024. "Technician routing and scheduling with employees’ learning through implicit cross-training strategy," International Journal of Production Economics, Elsevier, vol. 271(C).
    2. Wang, Wenshu & Xie, Kexin & Guo, Siqi & Li, Weixing & Xiao, Fan & Liang, Zhe, 2023. "A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements," European Journal of Operational Research, Elsevier, vol. 310(1), pages 360-378.
    3. Hideki Hashimoto & Sylvain Boussier & Michel Vasquez & Christophe Wilbaut, 2011. "A GRASP-based approach for technicians and interventions scheduling for telecommunications," Annals of Operations Research, Springer, vol. 183(1), pages 143-161, March.
    4. Chen, Xi & Hewitt, Mike & Thomas, Barrett W., 2018. "An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers," International Journal of Production Economics, Elsevier, vol. 196(C), pages 122-134.
    5. Snauwaert, Jakob & Vanhoucke, Mario, 2021. "A new algorithm for resource-constrained project scheduling with breadth and depth of skills," European Journal of Operational Research, Elsevier, vol. 292(1), pages 43-59.
    6. Bruck, Bruno P. & Cordeau, Jean-François & Iori, Manuel, 2018. "A practical time slot management and routing problem for attended home services," Omega, Elsevier, vol. 81(C), pages 208-219.
    7. Restrepo, María I. & Rousseau, Louis-Martin & Vallée, Jonathan, 2020. "Home healthcare integrated staffing and scheduling," Omega, Elsevier, vol. 95(C).
    8. Xiaoyun Xiong & Peng Zhou & Yunqiang Yin & T. C. E. Cheng & Dengfeng Li, 2019. "An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 502-516, September.
    9. Snauwaert, Jakob & Vanhoucke, Mario, 2023. "A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 1-19.
    10. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    11. Rob Eynde & Mario Vanhoucke, 2020. "Resource-constrained multi-project scheduling: benchmark datasets and decoupled scheduling," Journal of Scheduling, Springer, vol. 23(3), pages 301-325, June.
    12. Chen, Xi & Thomas, Barrett W. & Hewitt, Mike, 2016. "The technician routing problem with experience-based service times," Omega, Elsevier, vol. 61(C), pages 49-61.
    13. Avramidis, Athanassios N. & Chan, Wyean & Gendreau, Michel & L'Ecuyer, Pierre & Pisacane, Ornella, 2010. "Optimizing daily agent scheduling in a multiskill call center," European Journal of Operational Research, Elsevier, vol. 200(3), pages 822-832, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2024. "An updated survey of attended home delivery and service problems with a focus on applications," Annals of Operations Research, Springer, vol. 343(2), pages 885-922, December.
    2. Jean-François Cordeau & Manuel Iori & Dario Vezzali, 2023. "A survey of attended home delivery and service problems with a focus on applications," 4OR, Springer, vol. 21(4), pages 547-583, December.
    3. Nowak, Maciek & Szufel, Przemysław, 2024. "Technician routing and scheduling for the sharing economy," European Journal of Operational Research, Elsevier, vol. 314(1), pages 15-31.
    4. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    5. Fleckenstein, David & Klein, Robert & Steinhardt, Claudius, 2023. "Recent advances in integrating demand management and vehicle routing: A methodological review," European Journal of Operational Research, Elsevier, vol. 306(2), pages 499-518.
    6. Snauwaert, Jakob & Vanhoucke, Mario, 2023. "A classification and new benchmark instances for the multi-skilled resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 307(1), pages 1-19.
    7. Fangzhou Yan & Huaxin Qiu & Dongya Han, 2023. "Lagrangian Heuristic for Multi-Depot Technician Planning of Product Distribution and Installation with a Lunch Break," Mathematics, MDPI, vol. 11(3), pages 1-22, January.
    8. Naderi, Bahman & Begen, Mehmet A. & Zaric, Gregory S. & Roshanaei, Vahid, 2023. "A novel and efficient exact technique for integrated staffing, assignment, routing, and scheduling of home care services under uncertainty," Omega, Elsevier, vol. 116(C).
    9. Ehsan Pourjavad & Eman Almehdawe, 2022. "Optimization of the technician routing and scheduling problem for a telecommunication industry," Annals of Operations Research, Springer, vol. 315(1), pages 371-395, August.
    10. Chen, Xi & Li, Kaiwen & Lin, Sidian & Ding, Xiaosong, 2024. "Technician routing and scheduling with employees’ learning through implicit cross-training strategy," International Journal of Production Economics, Elsevier, vol. 271(C).
    11. Pei, Zhi & Dai, Xu & Yuan, Yilun & Du, Rui & Liu, Changchun, 2021. "Managing price and fleet size for courier service with shared drones," Omega, Elsevier, vol. 104(C).
    12. Rouba Ibrahim & Pierre L'Ecuyer, 2013. "Forecasting Call Center Arrivals: Fixed-Effects, Mixed-Effects, and Bivariate Models," Manufacturing & Service Operations Management, INFORMS, vol. 15(1), pages 72-85, May.
    13. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    14. Ge Yu & Sheldon H. Jacobson, 2020. "Primal-dual analysis for online interval scheduling problems," Journal of Global Optimization, Springer, vol. 77(3), pages 575-602, July.
    15. Ortiz-Barrios, Miguel & Arias-Fonseca, Sebastián & Ishizaka, Alessio & Barbati, Maria & Avendaño-Collante, Betty & Navarro-Jiménez, Eduardo, 2023. "Artificial intelligence and discrete-event simulation for capacity management of intensive care units during the Covid-19 pandemic: A case study," Journal of Business Research, Elsevier, vol. 160(C).
    16. Bredael, Dries & Vanhoucke, Mario, 2023. "Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates," European Journal of Operational Research, Elsevier, vol. 308(1), pages 54-75.
    17. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    18. Ferdinand Kiermaier & Markus Frey & Jonathan F. Bard, 2020. "The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers," Journal of Scheduling, Springer, vol. 23(2), pages 177-209, April.
    19. Yan Li & Xiao Xu & Fuyu Wang, 2023. "Research on Home Health Care Scheduling Considering Synchronous Access of Caregivers and Vehicles," Sustainability, MDPI, vol. 15(7), pages 1-18, April.
    20. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:321:y:2025:i:3:p:717-733. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.