IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v14y2017i1d10.1007_s10287-016-0265-2.html
   My bibliography  Save this article

Robust shift generation in workforce planning

Author

Listed:
  • Dori Hulst

    (Blue Rock Logistics)

  • Dick Hertog

    (Tilburg University)

  • Wim Nuijten

    (Quintiq
    Eindhoven University of Technology)

Abstract

In this paper we apply robust optimization techniques to the shift generation problem in workforce planning. At the time that the shifts are generated, there is often much uncertainty in the workload predictions. We propose a model to generate shifts that are robust against this uncertainty. An adversarial approach is used to solve the resulting robust optimization model. In each iteration an integer nonlinear knapsack problem is solved to calculate the worst case workload scenario. We apply the approach to generate shifts in a real-life Air Traffic Controller workforce planning problem. The numerical results show the value of our approach.

Suggested Citation

  • Dori Hulst & Dick Hertog & Wim Nuijten, 2017. "Robust shift generation in workforce planning," Computational Management Science, Springer, vol. 14(1), pages 115-134, January.
    • Handle: RePEc:spr:comgts:v:14:y:2017:i:1:d:10.1007_s10287-016-0265-2
    DOI: 10.1007/s10287-016-0265-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10287-016-0265-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10287-016-0265-2?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. Holte, Matias & Mannino, Carlo, 2013. "The implementor/adversary algorithm for the cyclic and robust scheduling problem in health-care," European Journal of Operational Research, Elsevier, vol. 226(3), pages 551-559.
    2. D. Dowling & M. Krishnamoorthy & H. Mackenzie & D. Sier, 1997. "Staff rostering at a large international airport," Annals of Operations Research, Springer, vol. 72(0), pages 125-147, January.
    3. Duan Li & Xiaoling Sun, 2006. "Nonlinear Integer Programming," International Series in Operations Research and Management Science, Springer, number 978-0-387-32995-6, January.
    4. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    5. Musliu, Nysret & Schaerf, Andrea & Slany, Wolfgang, 2004. "Local search for shift design," European Journal of Operational Research, Elsevier, vol. 153(1), pages 51-64, February.
    6. Turgut Aykin, 1996. "Optimal Shift Scheduling with Multiple Break Windows," Management Science, INFORMS, vol. 42(4), pages 591-602, April.
    7. Gorissen, Bram L. & den Hertog, Dick, 2013. "Robust counterparts of inequalities containing sums of maxima of linear functions," European Journal of Operational Research, Elsevier, vol. 227(1), pages 30-43.
    8. 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, Elsevier, vol. 153(1), pages 3-27, February.
    9. Bretthauer, Kurt M. & Shetty, Bala, 2002. "The nonlinear knapsack problem - algorithms and applications," European Journal of Operational Research, Elsevier, vol. 138(3), pages 459-472, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pieter Smet & Annelies Lejon & Greet Vanden Berghe, 2021. "Demand smoothing in shift design," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 457-484, June.
    2. Black, Ben & Ainslie, Russell & Dokka, Trivikram & Kirkbride, Christopher, 2023. "Distributionally robust resource planning under binomial demand intakes," European Journal of Operational Research, Elsevier, vol. 306(1), pages 227-242.
    3. Wu, Zhiying & Xu, Guoning & Chen, Qingxin & Mao, Ning, 2023. "Two stochastic optimization methods for shift design with uncertain demand," Omega, Elsevier, vol. 115(C).

    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. Lusby, Richard Martin & Range, Troels Martin & Larsen, Jesper, 2016. "A Benders decomposition-based matheuristic for the Cardinality Constrained Shift Design Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 385-397.
    2. Arjan Akkermans & Gerhard Post & Marc Uetz, 2021. "Solving the shift and break design problem using integer linear programming," Annals of Operations Research, Springer, vol. 302(2), pages 341-362, July.
    3. 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.
    4. Lusby, Richard Martin & Range, Troels Martin & Larsen, Jesper, 2015. "A Benders decomposition-based Matheuristic for the Cardinality Constrained Shift Design Problem," Discussion Papers on Economics 9/2015, University of Southern Denmark, Department of Economics.
    5. Hamed Mamani & Shima Nassiri & Michael R. Wagner, 2017. "Closed-Form Solutions for Robust Inventory Management," Management Science, INFORMS, vol. 63(5), pages 1625-1643, May.
    6. Banu Sungur & Cemal Özgüven & Yasemin Kariper, 2017. "Shift scheduling with break windows, ideal break periods, and ideal waiting times," Flexible Services and Manufacturing Journal, Springer, vol. 29(2), pages 203-222, June.
    7. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    8. Jens O. Brunner & Jonathan F. Bard & Jan M. Köhler, 2013. "Bounded flexibility in days‐on and days‐off scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(8), pages 678-701, December.
    9. Juan P. Cavada & Cristián E. Cortés & Gustavo Henríquez & Pablo A. Rey, 2023. "A ground crew shift rostering model for Santiago International Airport," Operational Research, Springer, vol. 23(1), pages 1-26, March.
    10. Hyun Jun Yang & Suk Jae Jeong & Sung Wook Yoon, 2020. "Enhancement for human resource management in the ULD build-up process of air-cargo terminal: a strategic linkage approach," Journal of Heuristics, Springer, vol. 26(2), pages 301-333, April.
    11. Pieter Smet & Annelies Lejon & Greet Vanden Berghe, 2021. "Demand smoothing in shift design," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 457-484, June.
    12. Chapados, Nicolas & Joliveau, Marc & L’Ecuyer, Pierre & Rousseau, Louis-Martin, 2014. "Retail store scheduling for profit," European Journal of Operational Research, Elsevier, vol. 239(3), pages 609-624.
    13. Marcio Costa Santos & Michael Poss & Dritan Nace, 2018. "A perfect information lower bound for robust lot-sizing problems," Annals of Operations Research, Springer, vol. 271(2), pages 887-913, December.
    14. Tohidi, Mohammad & Kazemi Zanjani, Masoumeh & Contreras, Ivan, 2021. "A physician planning framework for polyclinics under uncertainty," Omega, Elsevier, vol. 101(C).
    15. X. J. Zheng & X. L. Sun & D. Li, 2010. "Separable Relaxation for Nonconvex Quadratic Integer Programming: Integer Diagonalization Approach," Journal of Optimization Theory and Applications, Springer, vol. 146(2), pages 463-489, August.
    16. Bueno, L.F. & Haeser, G. & Kolossoski, O., 2024. "On the paper “Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem”," European Journal of Operational Research, Elsevier, vol. 313(3), pages 1217-1222.
    17. Agra, Agostinho & Poss, Michael & Santos, Micael, 2018. "Optimizing make-to-stock policies through a robust lot-sizing model," International Journal of Production Economics, Elsevier, vol. 200(C), pages 302-310.
    18. Wu, Zhiying & Xu, Guoning & Chen, Qingxin & Mao, Ning, 2023. "Two stochastic optimization methods for shift design with uncertain demand," Omega, Elsevier, vol. 115(C).
    19. Jonathan Bard & David Morton & Yong Wang, 2007. "Workforce planning at USPS mail processing and distribution centers using stochastic optimization," Annals of Operations Research, Springer, vol. 155(1), pages 51-78, November.
    20. Van den Bergh, Jorne & Beliën, Jeroen & De Bruecker, Philippe & Demeulemeester, Erik & De Boeck, Liesje, 2013. "Personnel scheduling: A literature review," European Journal of Operational Research, Elsevier, vol. 226(3), pages 367-385.

    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:spr:comgts:v:14:y:2017:i:1:d:10.1007_s10287-016-0265-2. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.