Skip to main content
Log in

Robust shift generation in workforce planning

  • Original Paper
  • Published:
Computational Management Science Aims and scope Submit manuscript

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.

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

Access this article

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

Instant access to the full article PDF.

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

Similar content being viewed by others

References

  • Aykin T (1996) Optimal shift scheduling with multiple break windows. Manag Sci 42(4):591–602

    Article  Google Scholar 

  • Barlatt AY (2009) Models and algorithms for workforce allocation and utilization. Dissertation, The University of Michigan

  • Ben-Tal A, Nemirovski A (1997) Stable truss topology design via semidefinite programming. SIAM J Optim 7(4):991–1016

    Article  Google Scholar 

  • Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769–805

    Article  Google Scholar 

  • Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton Press

  • Bertsimas D, Brown D, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464–501

    Article  Google Scholar 

  • Bhulai S, Koole G, Pot A (2008) Simple methods for shift scheduling in multiskill call centers. Manuf Ser Oper Manag 10(3):411–420

    Google Scholar 

  • Bienstock D (2007) Histogram models for robust portfolio optimization. J Comput Finance 11:1–64

    Article  Google Scholar 

  • Bienstock D, Özbay N (2008) Computing robust basestock levels. Discret Optim 5(2):389–414

    Article  Google Scholar 

  • Bretthauer KM, Shetty B (2002) The nonlinear knapsack problem: algorithms and applications. Eur J Oper Res 138:459–472

    Article  Google Scholar 

  • Caprara A, Monaci M, Toth P (2003) Models and algorithms for a staff scheduling problem. Math Program 98:445–476

    Article  Google Scholar 

  • Chen D, Meng F, Ang J, Chu S, Sim M, Kannapirank P (2011) A robust optimization model for managing elective admission in hospital. Working Paper

  • Clausen T (2011) Airport ground staff scheduling. Dissertation, Technical University of Denmark

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

    Article  Google Scholar 

  • El Ghaoui L, Lebret H (1997) Robust solution to least-squares problems with uncertain data. SIAM J Matrix Anal Appl 18:1035–1064

    Article  Google Scholar 

  • El Ghaoui L, Oustry F, Lebret H (1998) Robust solutions to uncertain semidefinite programs. SIAM J Optim 9:33–52

    Article  Google Scholar 

  • Ernst A, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3–27

    Article  Google Scholar 

  • Gorissen Gorissen BL, den Hertog D (2013) Robust counterparts of inequalities containing sums of maxima of linear functions. Eur J Oper Res 227(1):30–43

    Article  Google Scholar 

  • Holte M, Mannino C (2013) The implementor/adversarial algorithm for cyclic and robust scheduling problems in health-care. Eur J Oper Res 226:551–559

    Article  Google Scholar 

  • Kouvelis P, Yu G (1997) Robust discrete optimization and its application. Kluwer Academic Publishers, London

    Book  Google Scholar 

  • Kyngäs N, Goossens D, Nurmi K, Kyngäs J (2012) Optimizing the unlimited shift generation problem. Appl Evolut Comput Lect Notes Comput Sci 7248:508–518

    Article  Google Scholar 

  • Li D, Sun X (2006) Nonlinear integer programming, international series in operations research and management science, vol 84. Springer, USA

    Google Scholar 

  • Musliu N, Schaerf A, Slany W (2004) Local search for shift design. Eur J Oper Res 153(1):51–64

    Article  Google Scholar 

  • Nilssen EJ, Stølevik M, Johnsen EL, Nordlander TE (2011) Multi-skill shift design for Norwegian hospitals. J Appl Oper Res 3(3):137–147

    Google Scholar 

  • http://www.ortec.com (2015) ORTEC Harmony Advanced Workforce Management Software. http://www.ortec.com/media/files/productsheets/english/a0021_ortec_harmony_productsheet_en.pdf. Accessed 10 Jan 2015

  • http://www.airport-technology.com (2015) Quintiq—Airport Planning and Scheduling. http://www.airport-technology.com/contractors/consult/quintiq. Accessed 10 Jan 2015

  • http://www.clicksoftware.com (2015) SAP—Optimized Shift Planning and Scheduling. http://www.clicksoftware.com/Collateral/Documents/English-US/optimized-shift-planning-and-scheduling.pdf. Accessed 10 Jan 2015

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dori van Hulst.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

van Hulst, D., den Hertog, D. & Nuijten, W. Robust shift generation in workforce planning. Comput Manag Sci 14, 115–134 (2017). https://doi.org/10.1007/s10287-016-0265-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10287-016-0265-2

Keywords

Navigation