Robust shift generation in workforce planning
Dori Hulst (),
Dick Hertog and
Wim Nuijten
Additional contact information
Dori Hulst: Blue Rock Logistics
Dick Hertog: Tilburg University
Wim Nuijten: Quintiq
Computational Management Science, 2017, vol. 14, issue 1, No 7, 115-134
Abstract:
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.
Keywords: Robust optimization; Shift generation; Workforce planning (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)
Downloads: (external link)
http://link.springer.com/10.1007/s10287-016-0265-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:comgts:v:14:y:2017:i:1:d:10.1007_s10287-016-0265-2
Ordering information: This journal article can be ordered from
http://www.springer. ... ch/journal/10287/PS2
DOI: 10.1007/s10287-016-0265-2
Access Statistics for this article
Computational Management Science is currently edited by Ruediger Schultz
More articles in Computational Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().