IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v82y2019icp102-117.html
   My bibliography  Save this article

Optimised buffer allocation to construct stable personnel shift rosters

Author

Listed:
  • Ingels, Jonas
  • Maenhout, Broos

Abstract

Organisations need to construct stable baseline personnel shift rosters based on forecasts about the future personnel demand and employee availability. However, variability arises in the short-term, which renders these forecasts incorrect and affects the quality of the personnel roster. In this paper, we study how to anticipate this variability by introducing capacity buffers in the personnel shift roster. We propose a new approach by solving an equivalent deterministic formulation of a stochastic personnel shift scheduling problem. In contrast to traditional approaches, the size and position of capacity buffers are not defined in advance but are adequately determined as an endogenous variable by the proposed optimisation model to align the available personnel capacity to the stochastic demand. We propose different strategies to define the anticipated uncertainty and to allocate capacity buffers accordingly. We validate the performance of these strategies through a comparison with a deterministic minimum cost strategy and a more traditional resource buffer strategy based on a three-step methodology. This methodology makes use of simulation and optimisation to mimic the hierarchical personnel planning process.

Suggested Citation

  • Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.
  • Handle: RePEc:eee:jomega:v:82:y:2019:i:c:p:102-117
    DOI: 10.1016/j.omega.2017.12.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048316303991
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.omega.2017.12.006?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. François Vanderbeck, 2000. "On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm," Operations Research, INFORMS, vol. 48(1), pages 111-128, February.
    2. A.T. Ernst & H. Jiang & M. Krishnamoorthy & B. Owens & D. Sier, 2004. "An Annotated Bibliography of Personnel Scheduling and Rostering," Annals of Operations Research, Springer, vol. 127(1), pages 21-144, March.
    3. Abdelghany, Khaled F. & Abdelghany, Ahmed F. & Ekollu, Goutham, 2008. "An integrated decision support tool for airlines schedule recovery during irregular operations," European Journal of Operational Research, Elsevier, vol. 185(2), pages 825-848, March.
    4. Daniel Potthoff & Dennis Huisman & Guy Desaulniers, 2010. "Column Generation with Dynamic Duty Selection for Railway Crew Rescheduling," Transportation Science, INFORMS, vol. 44(4), pages 493-505, November.
    5. Ahmed Abdelghany & Goutham Ekollu & Ram Narasimhan & Khaled Abdelghany, 2004. "A Proactive Crew Recovery Decision Support Tool for Commercial Airlines During Irregular Operations," Annals of Operations Research, Springer, vol. 127(1), pages 309-331, March.
    6. HazIr, Öncü & Haouari, Mohamed & Erel, Erdal, 2010. "Robust scheduling and robustness measures for the discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 633-643, December.
    7. Jeffrey E. Dillon & Spyros Kontogiorgis, 1999. "US Airways Optimizes the Scheduling of Reserve Flight Crews," Interfaces, INFORMS, vol. 29(5), pages 123-131, October.
    8. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    9. Sergey Shebalov & Diego Klabjan, 2006. "Robust Airline Crew Pairing: Move-up Crews," Transportation Science, INFORMS, vol. 40(3), pages 300-312, August.
    10. William J. Abernathy & Nicholas Baloff & John C. Hershey & Sten Wandel, 1973. "A Three-Stage Manpower Planning and Scheduling Model—A Service-Sector Example," Operations Research, INFORMS, vol. 21(3), pages 693-711, June.
    11. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    12. Maenhout, Broos & Vanhoucke, Mario, 2013. "Reconstructing nurse schedules: Computational insights in the problem size parameters," Omega, Elsevier, vol. 41(5), pages 903-918.
    13. 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.
    14. Ahmed, Mohamed A. & Alkhamis, Talal M., 2009. "Simulation optimization for an emergency department healthcare unit in Kuwait," European Journal of Operational Research, Elsevier, vol. 198(3), pages 936-942, November.
    15. Vanhoucke, Mario & Maenhout, Broos, 2009. "On the characterization and generation of nurse scheduling problem instances," European Journal of Operational Research, Elsevier, vol. 196(2), pages 457-467, July.
    16. 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.
    17. Potthoff, D. & Huisman, D. & Desaulniers, G., 2008. "Column generation with dynamic duty selection for railway crew rescheduling," Econometric Institute Research Papers EI 2008-28, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    18. Olivella, Jordi & Nembhard, David, 2016. "Calibrating cross-training to meet demand mix variation and employee absence," European Journal of Operational Research, Elsevier, vol. 248(2), pages 462-472.
    19. Easton, F. F. & Rossin, D. F., 1997. "Overtime schedules for full-time service workers," Omega, Elsevier, vol. 25(3), pages 285-299, June.
    20. Jay M. Rosenberger & Andrew J. Schaefer & David Goldsman & Ellis L. Johnson & Anton J. Kleywegt & George L. Nemhauser, 2002. "A Stochastic Model of Airline Operations," Transportation Science, INFORMS, vol. 36(4), pages 357-377, November.
    21. K A Dowsland & J M Thompson, 2000. "Solving a nurse scheduling problem with knapsacks, networks and tabu search," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(7), pages 825-833, July.
    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. Caballini, Claudia & Paolucci, Massimo, 2020. "A rostering approach to minimize health risks for workers: An application to a container terminal in the Italian port of Genoa," Omega, Elsevier, vol. 95(C).
    2. Szwarc Eryk & Wikarek Jarosław, 2020. "Proactive Planning of Project Team Members’ Competences," Foundations of Management, Sciendo, vol. 12(1), pages 71-84, January.
    3. Wang, Wenshu & Xie, Kexin & Guo, Siqi & Li, Weixing & Xiao, Fan & Liang, Zhe, 2023. "A shift-based model to solve the integrated staff rostering and task assignment problem with real-world requirements," European Journal of Operational Research, Elsevier, vol. 310(1), pages 360-378.
    4. Eryk Szwarc & Grzegorz Bocewicz & Paulina Golińska-Dawson & Zbigniew Banaszak, 2023. "Proactive Operations Management: Staff Allocation with Competence Maintenance Constraints," Sustainability, MDPI, vol. 15(3), pages 1-20, January.

    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. Jonas Ingels & Broos Maenhout, 2017. "Employee substitutability as a tool to improve the robustness in personnel scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(3), pages 623-658, July.
    2. Jonas Ingels & Broos Maenhout, 2018. "The impact of overtime as a time-based proactive scheduling and reactive allocation strategy on the robustness of a personnel shift roster," Journal of Scheduling, Springer, vol. 21(2), pages 143-165, April.
    3. Borgonjon, Tessa & Maenhout, Broos, 2022. "An exact approach for the personnel task rescheduling problem with task retiming," European Journal of Operational Research, Elsevier, vol. 296(2), pages 465-484.
    4. Maenhout, Broos & Vanhoucke, Mario, 2018. "A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem," European Journal of Operational Research, Elsevier, vol. 269(3), pages 806-823.
    5. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    6. Breugem, T. & Dollevoet, T.A.B. & Huisman, D., 2017. "Is Equality always desirable?," Econometric Institute Research Papers EI2017-30, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Christopher Bayliss & Geert Maere & Jason A. D. Atkin & Marc Paelinck, 2017. "A simulation scenario based mixed integer programming approach to airline reserve crew scheduling under uncertainty," Annals of Operations Research, Springer, vol. 252(2), pages 335-363, May.
    8. Maenhout, Broos & Vanhoucke, Mario, 2013. "An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems," Omega, Elsevier, vol. 41(2), pages 485-499.
    9. Wolbeck, Lena & Kliewer, Natalia & Marques, Inês, 2020. "Fair shift change penalization scheme for nurse rescheduling problems," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1121-1135.
    10. Thomas Breugem & Twan Dollevoet & Dennis Huisman, 2022. "Is Equality Always Desirable? Analyzing the Trade-Off Between Fairness and Attractiveness in Crew Rostering," Management Science, INFORMS, vol. 68(4), pages 2619-2641, April.
    11. Broos Maenhout & Mario Vanhoucke, 2017. "A resource type analysis of the integrated project scheduling and personnel staffing problem," Annals of Operations Research, Springer, vol. 252(2), pages 407-433, May.
    12. Caballini, Claudia & Paolucci, Massimo, 2020. "A rostering approach to minimize health risks for workers: An application to a container terminal in the Italian port of Genoa," Omega, Elsevier, vol. 95(C).
    13. David Rea & Craig Froehle & Suzanne Masterson & Brian Stettler & Gregory Fermann & Arthur Pancioli, 2021. "Unequal but Fair: Incorporating Distributive Justice in Operational Allocation Models," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2304-2320, July.
    14. Ellen Bockstal & Broos Maenhout, 2019. "A study on the impact of prioritising emergency department arrivals on the patient waiting time," Health Care Management Science, Springer, vol. 22(4), pages 589-614, December.
    15. Melanie Erhard, 2021. "Flexible staffing of physicians with column generation," Flexible Services and Manufacturing Journal, Springer, vol. 33(1), pages 212-252, March.
    16. Ana Paias & Marta Mesquita & Margarida Moz & Margarida Pato, 2021. "A network flow-based algorithm for bus driver rerostering," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(2), pages 543-576, June.
    17. Young-Chae Hong & Amy Cohn & Stephen Gorga & Edmond O’Brien & William Pozehl & Jennifer Zank, 2019. "Using Optimization Techniques and Multidisciplinary Collaboration to Solve a Challenging Real-World Residency Scheduling Problem," Interfaces, INFORMS, vol. 49(3), pages 201-212, May.
    18. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    19. Lotfi Hidri & Achraf Gazdar & Mohammed M. Mabkhot, 2020. "Optimized Procedure to Schedule Physicians in an Intensive Care Unit: A Case Study," Mathematics, MDPI, vol. 8(11), pages 1-24, November.
    20. Damcı-Kurt, Pelin & Zhang, Minjiao & Marentay, Brian & Govind, Nirmal, 2019. "Improving physician schedules by leveraging equalization: Cases from hospitals in U.S," Omega, Elsevier, vol. 85(C), pages 182-193.

    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:eee:jomega:v:82:y:2019:i:c:p:102-117. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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.