Skip to main content
SpringerLink
Log in

Tabu Search Metaheuristic for the Penalty Minimization Personnel Task Scheduling Problem

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research: Recent Trends (MOTOR 2023)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1881))

  • 208 Accesses

Abstract

Personnel scheduling is an active research field motivated by not only economic considerations but also the understanding of importance of improving working conditions and fairness in assigning employees to tasks. A large number of daily tasks and an expanding staff require effective automation of the task allocation process. In the problem under consideration, given sets of tasks and staff, it is required to assign the certain number of employees to each task, taking into account their skills. The goal is to minimize penalties induced by conflicting assignments as well as by uneven workload of the staff. To solve the problem, a two-phase heuristic consisting of a greedy heuristic followed by a randomize tabu search has been developed. Computational experiments shows that the proposed approach allows us to find optimal or near-optimal solutions on instances corresponding to real-life problems.

The study of the first author was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (project FWNF-2022-0019). The research of the third author was funded by the Ministry of Education and Science of the Russian Federation No. 121041300065-9.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Similar content being viewed by others

References

  1. Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discret. Appl. Math. 18(1), 1–8 (1987). https://doi.org/10.1016/0166-218X(87)90037-0

    Article  MathSciNet  MATH  Google Scholar 

  2. Azadeh, A., Farahani, M.H., Eivazy, H., Nazari-Shirkouhi, S., Asadipour, G.: A hybrid meta-heuristic algorithm for optimization of crew scheduling. Appl. Soft Comput. 13(1), 158–164 (2013). https://doi.org/10.1016/j.asoc.2012.08.012, https://www.sciencedirect.com/science/article/pii/S1568494612003596

  3. Brucker, P., Qu, R., Burke, E.: Personnel scheduling: models and complexity. Eur. J. Oper. Res. 210(3), 467–473 (2011). https://doi.org/10.1016/j.ejor.2010.11.017

    Article  MathSciNet  MATH  Google Scholar 

  4. Burke, E.K., Causmaecker, P.D., Berghe, G.V., Landeghem, H.V.: The state of the art of nurse rostering. J. Sched. 7, 441–499 (2004). https://doi.org/10.1023/B:JOSH.0000046076.75950.0b

    Article  MathSciNet  MATH  Google Scholar 

  5. Chandrasekharan, R.C., Smet, P., Wauters, T.: An automatic constructive matheuristic for the shift minimization personnel task scheduling problem. J. Heuristics 27, 205–227 (2021). https://doi.org/10.1007/s10732-020-09439-9

    Article  Google Scholar 

  6. Cheang, B., Li, H., Lim, A., Rodrigues, B.: Nurse rostering problems - a bibliographic survey. Eur. J. Oper. Res. 151(3), 447–460 (2003). https://doi.org/10.1016/S0377-2217(03)00021-3

    Article  MathSciNet  MATH  Google Scholar 

  7. Davydov, I., Kochetov, Y., Dempe, S.: Local search approach for the competitive facility location problem in mobile networks. Int. J. Artif. Intell. 16(1), 130–143 (2018)

    Google Scholar 

  8. De Bruecker, P., Van den Bergh, J., Beliën, J., Demeulemeester, E.: Workforce planning incorporating skills: state of the art. Eur. J. Oper. Res. 243(1), 1–16 (2015). https://doi.org/10.1016/j.ejor.2014.10.038

    Article  MathSciNet  MATH  Google Scholar 

  9. Doi, T., Nishi, T., Voss, S.: Two-level decomposition based matheuristic for airline crew rostering problems with fair working time. Eur. J. Oper. Res. 267 (2017). https://doi.org/10.1016/j.ejor.2017.11.046

  10. Erhard, M., Schoenfelder, J., Fügener, A., Brunner, J.O.: State of the art in physician scheduling. Eur. J. Oper. Res. 265(1), 1–18 (2018). https://doi.org/10.1016/j.ejor.2017.06.037

    Article  MathSciNet  MATH  Google Scholar 

  11. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., Sier, D.: An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127, 21–144 (2004). https://doi.org/10.1023/B:ANOR.0000019087.46656.e2

    Article  MathSciNet  MATH  Google Scholar 

  12. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. Eur. J. Oper. Res. 153(1), 3–27 (2004). https://doi.org/10.1016/S0377-2217(03)00095-X, timetabling and Rostering

  13. Fages, J.G., Lapègue, T.: Filtering atmostnvalue with difference constraints: application to the shift minimisation personnel task scheduling problem. Artif. Intell. 212, 116–133 (2014). https://doi.org/10.1016/j.artint.2014.04.001

    Article  MathSciNet  MATH  Google Scholar 

  14. Fischetti, M., Martello, S., Toth, P.: Approximation algorithms for fixed job schedule problems. Oper. Res. 40(1-supplement-1), S96–S108 (1992). https://doi.org/10.1287/opre.40.1.S96

  15. Gendreau, M., Potvin, J.Y.: Tabu search. In: Burke, E.K., Kendall, G. (eds.) Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, pp. 165–186. Springer, US, Boston, MA (2005). https://doi.org/10.1007/0-387-28356-0_6

  16. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533–549 (1986). https://doi.org/10.1016/0305-0548(86)90048-1

    Article  MathSciNet  MATH  Google Scholar 

  17. Glover, F.: Tabu search-part ii. ORSA J. Comput. 2(1), 4–32 (1990). https://doi.org/10.1287/ijoc.2.1.4

  18. Glover, F.: Tabu search-part i. ORSA J. Comput. 1(3), 190–206 (1989). https://doi.org/10.1287/ijoc.1.3.190

  19. Gopalakrishnan, B., Johnson, E.: Airline crew scheduling: state-of-the-art. Ann. Oper. Res. 140(1), 305–337 (2005). https://doi.org/10.1007/s10479-005-3975-3

    Article  MathSciNet  MATH  Google Scholar 

  20. Heil, J., Hoffmann, K., Buscher, U.: Railway crew scheduling: models, methods and applications. Eur. J. Oper. Res. 283(2), 405–425 (2020). https://doi.org/10.1016/j.ejor.2019.06.016

    Article  MathSciNet  MATH  Google Scholar 

  21. Hojati, M.: A greedy heuristic for shift minimization personnel task scheduling problem. Comput. Oper. Res. 100, 66–76 (2018). https://doi.org/10.1016/j.cor.2018.07.010

    Article  MathSciNet  MATH  Google Scholar 

  22. Kasirzadeh, A., Saddoune, M., Soumis, F.: Airline crew scheduling: models, algorithms, and data sets. EURO J. Transp. Logist. 6(2), 111–137 (2017). https://doi.org/10.1007/s13676-015-0080-x

  23. Kletzander, L., Musliu, N.: Solving the general employee scheduling problem. Comput. Oper. Res. 113, 104794 (2020). https://doi.org/10.1016/j.cor.2019.104794

    Article  MathSciNet  MATH  Google Scholar 

  24. Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval scheduling: a survey. Nav. Res. Logist. Q. 54(5), 530–543 (2007). https://doi.org/10.1002/nav.20231

    Article  MathSciNet  MATH  Google Scholar 

  25. Krishnamoorthy, M., Ernst, A.T.: The personnel task scheduling problem. In: Yang, X., Teo, K.L., Caccetta, L. (eds.) Optimization Methods and Applications, Applied Optimization, vol. 52, pp. 343–368. Springer, Boston (2001). https://doi.org/10.1007/978-1-4757-3333-4_20

  26. Krishnamoorthy, M., Ernst, A.T., Baatar, D.: Algorithms for large scale shift minimisation personnel task scheduling problems. Eur. J. Oper. Res. 219(1), 34–48 (2012). https://doi.org/10.1016/j.ejor.2011.11.034

    Article  MathSciNet  MATH  Google Scholar 

  27. Kroon, L.G., Salomon, M., Wassenhove, L.N.V.: Exact and approximation algorithms for the tactical fixed interval scheduling problem. Oper. Res. 45(4), 624–638 (1997). https://doi.org/10.1287/opre.45.4.624

    Article  MathSciNet  MATH  Google Scholar 

  28. Lapègue, T., Bellenguez-Morineau, O., Prot, D.: A constraint-based approach for the shift design personnel task scheduling problem with equity. Comput. Oper. Res. 40(10), 2450–2465 (2013). https://doi.org/10.1016/j.cor.2013.04.005

    Article  MATH  Google Scholar 

  29. Lin, S.W., Ying, K.C.: Minimizing shifts for personnel task scheduling problems: a three-phase algorithm. Eur. J. Oper. Res. 237(1), 323–334 (2014). https://doi.org/10.1016/j.ejor.2014.01.035

    Article  MathSciNet  MATH  Google Scholar 

  30. Nurmi, K., as, N.K.: A successful three-phase metaheuristic for the shift minimization personal task scheduling problem. Adv. Oper. Res. 2021, 8876990 (2021). https://doi.org/10.1155/2021/8876990

  31. Prajapati, V.K., Jain, M., Chouhan, L.: Tabu search algorithm (TSA): a comprehensive survey. In: Proceedings of the 3rd International Conference on Emerging Technologies in Computer Engineering: Machine Learning and Internet of Things, pp. 1–8, February 2020. https://doi.org/10.1109/ICETCE48199.2020.9091743

  32. Örmeci, E.L., Salman, F.S., Yücel, E.: Staff rostering in call centers providing employee transportation. Omega 43, 41–53 (2014). https://doi.org/10.1016/j.omega.2013.06.003

    Article  Google Scholar 

  33. Smet, P., Wauters, T., Mihaylov, M., Vanden Berghe, G.: The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights. Omega 46, 64–73 (2014). https://doi.org/10.1016/j.omega.2014.02.003

    Article  Google Scholar 

  34. Valls, V., Pérez, A., Quintanilla, S.: A graph colouring model for assigning a heterogeneous workforce to a given schedule. Eur. J. Oper. Res. 90(2), 285–302 (1996). https://doi.org/10.1016/0377-2217(95)00355-X

    Article  MATH  Google Scholar 

  35. Van den Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013). https://doi.org/10.1016/j.ejor.2012.11.029

    Article  MathSciNet  MATH  Google Scholar 

  36. Wen, X., Sun, X., Sun, Y., Yue, X.: Airline crew scheduling: models and algorithms. Transp. Res. E 149, 102304 (2021). https://doi.org/10.1016/j.tre.2021.102304

    Article  Google Scholar 

  37. Xu, S., Hall, N.G.: Fatigue, personnel scheduling and operations: review and research opportunities. Eur. J. Oper. Res. 295(3), 807–822 (2021). https://doi.org/10.1016/j.ejor.2021.03.036

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics of SB RAS, 4 Acad. Koptyug av., 630090, Novosibirsk, Russia

    Ivan Davydov

  2. Matrosov Institute for System Dynamics and Control Theory of SB RAS, 134 Lermontov str., 664033, Irkutsk, Russia

    Igor Vasilyev & Anton V. Ushakov

  3. Novosibirsk Research Center, Huawei Russian Research Institute, 630090, Novosibirsk, Russia

    Igor Vasilyev

Authors
  1. Ivan Davydov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Vasilyev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anton V. Ushakov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Davydov .

Editor information

Editors and Affiliations

  1. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  2. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Yury Kochetov

  3. Sobolev Institute of Mathematics, Omsk, Russia

    Anton Eremeev

  4. Melentiev Energy Systems Institute, Irkutsk, Russia

    Oleg Khamisov

  5. Institute of Applied Mathematical Research, Petrozavodsk, Russia

    Vladimir Mazalov

  6. University of Florida, Gainesville, FL, USA

    Panos Pardalos

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

Davydov, I., Vasilyev, I., Ushakov, A.V. (2023). Tabu Search Metaheuristic for the Penalty Minimization Personnel Task Scheduling Problem. In: Khachay, M., Kochetov, Y., Eremeev, A., Khamisov, O., Mazalov, V., Pardalos, P. (eds) Mathematical Optimization Theory and Operations Research: Recent Trends. MOTOR 2023. Communications in Computer and Information Science, vol 1881. Springer, Cham. https://doi.org/10.1007/978-3-031-43257-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-43257-6_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-43256-9

  • Online ISBN: 978-3-031-43257-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation