IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v269y2018i3p806-823.html
   My bibliography  Save this article

A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem

Author

Listed:
  • Maenhout, Broos
  • Vanhoucke, Mario

Abstract

In this paper, we propose a heuristic optimisation procedure for the integrated personnel shift and task re-scheduling problem. We assume that schedule disruptions arise as the baseline personnel roster is subject to three sources of operational variability, i.e. uncertainty of capacity, uncertainty of demand and uncertainty of arrival. In order to restore the feasibility of the personnel roster and to minimise the number of deviations compared to the original roster, we propose a heuristic re-scheduling procedure that thrives on a perturbation mechanism to diversify the search and a variable neighbourhood search to intensify the search in the region of a solution point. In the computational experiments, we assess the contribution of the different algorithmic building blocks and benchmark our algorithm with other optimisation procedures.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:269:y:2018:i:3:p:806-823
    DOI: 10.1016/j.ejor.2018.03.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221718302145
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2018.03.005?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. Margarida Moz & Margarida Pato, 2004. "Solving the Problem of Rerostering Nurse Schedules with Hard Constraints: New Multicommodity Flow Models," Annals of Operations Research, Springer, vol. 128(1), pages 179-197, April.
    2. Samavati, Mehran & Essam, Daryl & Nehring, Micah & Sarker, Ruhul, 2017. "A local branching heuristic for the open pit mine production scheduling problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 261-271.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. de Matta, Renato & Peters, Emmanuel, 2009. "Developing work schedules for an inter-city transit system with multiple driver types and fleet types," European Journal of Operational Research, Elsevier, vol. 192(3), pages 852-865, February.
    8. Margarida Moz & Margarida Pato, 2003. "An Integer Multicommodity Flow Model Applied to the Rerostering of Nurse Schedules," Annals of Operations Research, Springer, vol. 119(1), pages 285-301, March.
    9. 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.
    10. 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.
    11. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    12. Maenhout, Broos & Vanhoucke, Mario, 2013. "Reconstructing nurse schedules: Computational insights in the problem size parameters," Omega, Elsevier, vol. 41(5), pages 903-918.
    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. Liping Ge & Stefan Voß & Lin Xie, 2022. "Robustness and disturbances in public transport," Public Transport, Springer, vol. 14(1), pages 191-261, March.
    2. 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.
    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.

    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. Ingels, Jonas & Maenhout, Broos, 2019. "Optimised buffer allocation to construct stable personnel shift rosters," Omega, Elsevier, vol. 82(C), pages 102-117.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Smirnov, Dmitry & Huchzermeier, Arnd, 2020. "Analytics for labor planning in systems with load-dependent service times," European Journal of Operational Research, Elsevier, vol. 287(2), pages 668-681.
    10. 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.
    11. Sanja Petrovic, 2019. "“You have to get wet to learn how to swim” applied to bridging the gap between research into personnel scheduling and its implementation in practice," Annals of Operations Research, Springer, vol. 275(1), pages 161-179, April.
    12. De Bruecker, Philippe & Van den Bergh, Jorne & Beliën, Jeroen & Demeulemeester, Erik, 2015. "Workforce planning incorporating skills: State of the art," European Journal of Operational Research, Elsevier, vol. 243(1), pages 1-16.
    13. Emir Hüseyin Özder & Evrencan Özcan & Tamer Eren, 2019. "Staff Task-Based Shift Scheduling Solution with an ANP and Goal Programming Method in a Natural Gas Combined Cycle Power Plant," Mathematics, MDPI, vol. 7(2), pages 1-26, February.
    14. 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.
    15. Hassani, Rachid & Desaulniers, Guy & Elhallaoui, Issmail, 2021. "Real-time bi-objective personnel re-scheduling in the retail industry," European Journal of Operational Research, Elsevier, vol. 293(1), pages 93-108.
    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. Mesquita, Marta & Moz, Margarida & Paias, Ana & Pato, Margarida, 2015. "A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern," European Journal of Operational Research, Elsevier, vol. 245(2), pages 423-437.
    18. Christopher N. Gross & Andreas Fügener & Jens O. Brunner, 2018. "Online rescheduling of physicians in hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 296-328, June.
    19. Marta Rocha & José Oliveira & Maria Carravilla, 2014. "A constructive heuristic for staff scheduling in the glass industry," Annals of Operations Research, Springer, vol. 217(1), pages 463-478, June.
    20. Lai, David S.W. & Leung, Janny M.Y. & Dullaert, Wout & Marques, Inês, 2020. "A graph-based formulation for the shift rostering problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 285-300.

    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:ejores:v:269:y:2018:i:3:p:806-823. 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/locate/eor .

    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.