Skip to main content
SpringerLink
Log in

An automatic constructive matheuristic for the shift minimization personnel task scheduling problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

The shift minimization personnel task scheduling problem is an NP-complete optimization problem that concerns the assignment of tasks to multi-skilled employees with a view to minimize the total number of assigned employees. Recent literature indicates that hybrid methods which combine exact and heuristic techniques such as matheuristics are efficient as regards to generating high quality solutions. The present work employs a constructive matheuristic (CMH): a decomposition-based method where sub-problems are solved to optimality using exact techniques. The optimal solutions of sub-problems are subsequently utilized to construct a feasible solution for the entire problem. Based on the study, a time-based CMH has been developed which, for the first time, solves all the difficult instances introduced by Smet et al. (Omega 46:64–73, 2014) to optimality. In addition, an automated CMH algorithm that utilizes instance-specific problem features has also been developed that produces high quality solutions over all current benchmark instances.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

Notes

  1. The benchmark data sets Data_137, Data_10 and Data_100 are available at http://people.brunel.ac.uk/~mastjjb/jeb/info.html, https://people.cs.kuleuven.be/~pieter.smet/smptsp.html and https://sites.google.com/site/ptsplib/smptsp/instances respectively.

  2. Note that Data_100 was unavailable when Smet et al. (2014) was published. The performance results of Smet et al. (2014) on the Data_100 instances were therefore obtained upon request.

References

  • Baatar, D., Krishnamoorthy, M., Ernst, A.T.: A triplet-based exact method for the shift minimisation personnel task scheduling problem. In: Bansal, N., Finocchi, I. (eds.) Algorithms-ESA 2015, pp. 59–70. Springer, Berlin (2015)

    Chapter  Google Scholar 

  • Chandrasekharan, R.C., Toffolo, T.A.M., Wauters, T.: Analysis of a constructive matheuristic for the traveling umpire problem. J. Quant. Anal. Sports 15(1), 41–57 (2019)

    Article  Google Scholar 

  • Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213, 67–78 (2014)

    Article  MathSciNet  Google Scholar 

  • den Bergh, J.V., Belién, J., Bruecker, P.D., Demeulemeester, E., Boeck, L.D.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)

    Article  MathSciNet  Google Scholar 

  • Dowling, D., Krishnamoorthy, M., Mackenzie, H., Sier, D.: Staff rostering at a large international airport. Ann. Oper. Res. 72, 125–147 (1997)

    Article  Google Scholar 

  • Fages, J., Lapègue, T.: Filtering atmostnvalue with difference constraints: application to the shift minimisation personnel task scheduling problem. Artif. Intell. 212, 116–133 (2014)

    Article  MathSciNet  Google Scholar 

  • Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23–47 (2003)

    Article  MathSciNet  Google Scholar 

  • Hojati, M.: A greedy heuristic for shift minimization personnel task scheduling problem. Comput. Oper. Res. 100, 66–76 (2018)

    Article  MathSciNet  Google Scholar 

  • Kolen, A.W., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.: Interval scheduling: a survey. Nav. Res. Log. (NRL) 54(5), 530–543 (2007)

    Article  MathSciNet  Google Scholar 

  • Krishnamoorthy, M., Ernst, A., Baatar, D.: Algorithms for large scale shift minimisation personnel task scheduling problems. Eur. J. Oper. Res. 219, 34–48 (2012)

    Article  MathSciNet  Google Scholar 

  • Lin, S., Ying, K.: Minimizing shifts for personnel task scheduling problems: a three-phase algorithm. Eur. J. Oper. Res. 237, 323–334 (2014)

    Article  MathSciNet  Google Scholar 

  • Maniezzo, V., Stützle, T., Voß, S.: Matheuristics: Hybridizing Metaheuristics and Mathematical Programming, 1st edn. Springer, Berlin (2009). ISBN 144191305X, 9781441913050

    MATH  Google Scholar 

  • Ramesh, D.N., Krishnamoorthy, M., Ernst, A.T.: Efficient models, formulations and algorithms for some variants of fixed interval scheduling problems. In: Sarker, R., Abbass, H.A., Dunstall, S., Kilby, P., Davis, R., Young, L. (eds.) Data and Decision Sciences in Action, pp. 43–69. Springer, Cham (2018)

    Chapter  Google Scholar 

  • Santos, H.G., Toffolo, T.A.M., Gomes, R.A.M., Ribas, S.: Integer programming techniques for the nurse rostering problem. Ann. Oper. Res. 239, 225–251 (2016)

    Article  MathSciNet  Google Scholar 

  • Smet, P., Vanden Berghe, G.: A matheuristic approach to the shift minimisation personnel task scheduling problem. In: Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling, PATAT, 2012, pp. 145–151 (2012)

  • Smet, P., Wauters, T., Mihaylov, M., Berghe, G.V.: The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights. Omega 46, 64–73 (2014)

    Article  Google Scholar 

  • Solyali, O.: The shift minimization personnel task scheduling problem: an effective lower bounding procedure. Hacettepe Úniversitesi İktisadi ve İdari Bilimler Fakúltesi Dergisi 34(2), 115–132 (2016)

    Google Scholar 

  • Wolsey, L.A.: Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, New York (1998). ISBN 0471283665

    Google Scholar 

Download references

Acknowledgements

We would like to thank Luke Conolly (KU Leuven) for providing editorial consultation. Research supported by Data-driven logistics (FWO-S007318N).

Author information

Authors and Affiliations

  1. Department of Computer Science, CODeS, KU Leuven, Gebroeders De Smetstraat 1, 9000, Ghent, Belgium

    Reshma Chirayil Chandrasekharan, Pieter Smet & Tony Wauters

Authors
  1. Reshma Chirayil Chandrasekharan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pieter Smet
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tony Wauters
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reshma Chirayil Chandrasekharan.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chirayil Chandrasekharan, R., 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

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-020-09439-9

Keywords

Search

Navigation