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

Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds

Author

Listed:
  • Böðvarsdóttir, Elín Björk
  • Smet, Pieter
  • Vanden Berghe, Greet
  • Stidsen, Thomas J.R.

Abstract

Despite the multi-objective nature of the nurse rostering problem (NRP), most NRP formulations employ a single evaluation function that minimizes the weighted sum of constraint violations. When solving the NRP in practice, the focus should be on obtaining compromise solutions: those with appropriate trade-offs between different constraints. Due to the real-world characteristics of the problem, appropriate trade-offs may vary substantially across instances, and quantifying these trade-offs does not necessarily translate well into a single evaluation function. This paper introduces a new multi-objective approach for the NRP that promotes controlled trade-offs and guides the solver towards acceptable compromise solutions. The method consists of two phases. The first phase quantifies the characteristics of acceptable compromise solutions by estimating acceptance thresholds that implicitly incorporate trade-offs. This quantification is performed automatically by drawing upon the instance at hand and identifying appropriate trade-offs. The second phase solves the NRP by employing these acceptance thresholds in a lexicographic goal programming framework. By automatically estimating instance-specific acceptance thresholds, we not only require minimal information from the user but also obtain a realistic prediction for solution quality. A case study shows that the methodology produces rosters with little or no deviations from acceptance thresholds, within only a few minutes. Furthermore, this methodology provides the user with clear reasoning behind the trade-offs made, as opposed to methods employing a single evaluation function.

Suggested Citation

  • Böðvarsdóttir, Elín Björk & Smet, Pieter & Vanden Berghe, Greet & Stidsen, Thomas J.R., 2021. "Achieving compromise solutions in nurse rostering by using automatically estimated acceptance thresholds," European Journal of Operational Research, Elsevier, vol. 292(3), pages 980-995.
  • Handle: RePEc:eee:ejores:v:292:y:2021:i:3:p:980-995
    DOI: 10.1016/j.ejor.2020.11.017
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2020.11.017?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. Edmund Burke & Jingpeng Li & Rong Qu, 2012. "A Pareto-based search methodology for multi-objective nurse scheduling," Annals of Operations Research, Springer, vol. 196(1), pages 91-109, July.
    2. Sanja Petrovic & Greet Berghe, 2012. "A comparison of two approaches to nurse rostering problems," Annals of Operations Research, Springer, vol. 194(1), pages 365-384, April.
    3. Li, Jingpeng & Burke, Edmund K. & Curtois, Tim & Petrovic, Sanja & Qu, Rong, 2012. "The falling tide algorithm: A new multi-objective approach for complex workforce scheduling," Omega, Elsevier, vol. 40(3), pages 283-293.
    4. Luque, Mariano & Miettinen, Kaisa & Eskelinen, Petri & Ruiz, Francisco, 2009. "Incorporating preference information in interactive reference point methods for multiobjective optimization," Omega, Elsevier, vol. 37(2), pages 450-462, April.
    5. 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.
    6. Tom Rihm & Philipp Baumann, 2018. "Staff assignment with lexicographically ordered acceptance levels," Journal of Scheduling, Springer, vol. 21(2), pages 167-189, April.
    7. Smet, Pieter & Brucker, Peter & De Causmaecker, Patrick & Vanden Berghe, Greet, 2016. "Polynomially solvable personnel rostering problems," European Journal of Operational Research, Elsevier, vol. 249(1), pages 67-75.
    Full references (including those not matched with items on IDEAS)

    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. Tristan Becker & Pia Mareike Steenweg & Brigitte Werners, 2019. "Cyclic shift scheduling with on-call duties for emergency medical services," Health Care Management Science, Springer, vol. 22(4), pages 676-690, December.
    2. 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.
    3. 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.
    4. Ademir Constantino & Dario Landa-Silva & Everton Melo & Candido Mendonça & Douglas Rizzato & Wesley Romão, 2014. "A heuristic algorithm based on multi-assignment procedures for nurse scheduling," Annals of Operations Research, Springer, vol. 218(1), pages 165-183, July.
    5. Elín Björk Böðvarsdóttir & Niels-Christian Fink Bagger & Laura Elise Høffner & Thomas J. R. Stidsen, 2022. "A flexible mixed integer programming-based system for real-world nurse rostering," Journal of Scheduling, Springer, vol. 25(1), pages 59-88, February.
    6. Mansini, Renata & Zanella, Marina & Zanotti, Roberto, 2023. "Optimizing a complex multi-objective personnel scheduling problem jointly complying with requests from customers and staff," Omega, Elsevier, vol. 114(C).
    7. 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.
    8. Gülcin Ermis & Can Akkan, 2019. "Search algorithms for improving the pareto front in a timetabling problem with a solution network-based robustness measure," Annals of Operations Research, Springer, vol. 275(1), pages 101-121, April.
    9. Castaño, Fabián & Velasco, Nubia, 2020. "Exact and heuristic approaches for the automated design of medical trainees rotation schedules," Omega, Elsevier, vol. 97(C).
    10. 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.
    11. 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).
    12. 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.
    13. 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.
    14. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    15. 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.
    16. Goel, Asvin & Meisel, Frank, 2013. "Workforce routing and scheduling for electricity network maintenance with downtime minimization," European Journal of Operational Research, Elsevier, vol. 231(1), pages 210-228.
    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. Sara Ceschia & Rosita Guido & Andrea Schaerf, 2020. "Solving the static INRC-II nurse rostering problem by simulated annealing based on large neighborhoods," Annals of Operations Research, Springer, vol. 288(1), pages 95-113, May.
    19. Paraskevopoulos, Dimitris C. & Laporte, Gilbert & Repoussis, Panagiotis P. & Tarantilis, Christos D., 2017. "Resource constrained routing and scheduling: Review and research prospects," European Journal of Operational Research, Elsevier, vol. 263(3), pages 737-754.
    20. 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.

    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:292:y:2021:i:3:p:980-995. 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.