Skip to main content
SpringerLink
Log in

A scenario-based robust optimization with a pessimistic approach for nurse rostering problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Nurse rostering problem (NRP) or nurse scheduling problem is a combinatorial optimization problem that involves the assignment of shifts to nurses while managing coverage constraints, expertise categories, labor legislation, contractual agreements, personal preferences, etc. The focus on this problem serves to improve service quality, nurse health and their satisfaction, and reduction of hospital costs. The existence of uncertainties and inaccurate estimates of the workload leads to a non-optimal or an infeasible solution. In this study, due to the importance of human resource management and crisis management in the health care system, a sustainable approach was developed with a robust scenario-based optimization method. Since NRP is a NP-hard problem, it is impossible to solve it in medium and large sizes in reasonable time. In this paper, a well-known metaheuristic algorithm, namely the differential evolution (DE) algorithm was proposed due to its sound structural features for searching in binary space. Then its performance was compared against the genetic algorithm. The results show that the DE algorithm has good performance.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  • Ali IM, Essam D, Kasmarik K (2020) A novel design of differential evolution for solving discrete traveling salesman problems. Swarm Evol Comput 52:100607

    Article  Google Scholar 

  • Arshad AS, Shamila H, Jabeen R, Fazli A (2012) Measuring patient satisfaction, a cross sectional study to improve quality of care at a tertiary care hospital. Healthline 3:59–62

    Google Scholar 

  • Awadallah MA, Bolaji ALA, Al-Betar MA (2015) A hybrid artificial bee colony for a nurse rostering problem. Appl Soft Comput 35:726–739

    Article  Google Scholar 

  • Azaiez MN, Al Sharif SS (2005) A 0–1 goal programming model for nurse scheduling. Comput Oper Res 32(3):491–507

    Article  MathSciNet  Google Scholar 

  • Bagheri M, Devin AG, Izanloo A (2016) An application of stochastic programming method for nurse scheduling problem in real word hospital. Comput Ind Eng 96:192–200

    Article  Google Scholar 

  • Brucker P, Qu R, Burke E (2011) Personnel scheduling: models and complexity. Eur J Oper Res 210(3):467–473

    Article  MathSciNet  Google Scholar 

  • Brunner JO, Bard JF, Köhler JM (2013) Bounded flexibility in days-on and days‐off scheduling. Nav Res Logist 60(8):678–701

    Article  MathSciNet  Google Scholar 

  • Burke EK, De Causmaecker P, Berghe GV, Van Landeghem H (2004) The state of the art of nurse rostering. J Sched 7(6):441–499

    Article  MathSciNet  Google Scholar 

  • Darling R, Sendir M, Atav S, Buyukyilmaz F (2017) Undergraduate nursing students and the elderly: an assessment of attitudes in a Turkish university. Gerontol Geriatr Educ 39(2):1–12

    Google Scholar 

  • De Causmaecker P, Berghe GV (2011) A categorisation of nurse rostering problems. J Sched 14(1):3–16

    Article  Google Scholar 

  • El Adoly AA, Gheith M, Fors MN (2018) A new formulation and solution for the nurse scheduling problem: a case study in Egypt. Alex Eng J 57(4):2289–2298

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Eskandari A, Ziarati K (2008) Nurse rostering using fuzzy logic: a case study. J Ind Eng Int 4(7):69–82

    Google Scholar 

  • Glass CA, Knight RA (2010) The nurse rostering problem: a critical appraisal of the problem structure. Eur J Oper Res 202(2):379–389

    Article  Google Scholar 

  • Huang H, Lin W, Lin Z, Hao Z, Lim A (2014) An evolutionary algorithm based on constraint set partitioning for nurse rostering problems. Neural Comput Appl 25(3–4):703–715

    Article  Google Scholar 

  • Ingels J, Maenhout B (2015) The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation. Comput Oper Res 61:153–169

    Article  MathSciNet  Google Scholar 

  • Kang D, Lansey K (2012) Scenario-based robust optimization of regional water and wastewater infrastructure. J Water Resour Plan Manag 139(3):325–338

    Article  Google Scholar 

  • Kellogg DL, Walczak S (2007) Nurse scheduling: from academia to implementation or not? Interfaces 37(4):355–369

    Article  Google Scholar 

  • Khurana S, Banerjee S (2018) An optimization process by Taguchi method for customer satisfaction under banking sector. Int J Comput Math Sci 7(3):197–213

    Google Scholar 

  • Lagatie R, Haspeslagh S, De Causmaecker P (2009) Negotiation protocols for distributed nurse rostering. In: Proceedings of the 21st Benelux conference on artificial intelligence, pp 145–152

  • Maass KL, Liu B, Daskin MS, Duck M, Wang Z, Mwenesi R, Schapiro H (2017) Incorporating nurse absenteeism into staffing with demand uncertainty. Health Care Manag Sci 20(1):141–155

    Article  Google Scholar 

  • Okada M (1992) An approach to the generalized nurse scheduling problem—generation of a declarative program to represent institution-specific knowledge. Comput Biomed Res 25(5):417–434

    Article  Google Scholar 

  • Onwubolu G, Davendra D (2006) Scheduling flow shops using differential evolution algorithm. Eur J Oper Res 171(2):674–692

    Article  Google Scholar 

  • Osogami T, Imai H (2000, December) Classification of various neighborhood operations for the nurse scheduling problem. In: International symposium on algorithms and computation. Springer, Berlin, pp 72–83

  • Parr D, Thompson JM (2007) Solving the multi-objective nurse scheduling problem with a weighted cost function. Ann Oper Res 155(1):279–288

    Article  MathSciNet  Google Scholar 

  • Pham VN, Thi L, H. A., & Dinh TP (2012) Solving nurse rostering problems by a multiobjective programming approach. In: International conference on computational collective intelligence. Springer, Berlin, pp 544–552

  • Price K, Storn RM, Lampinen JA (2006) Differential evolution: a practical approach to global optimization. Springer, New York

    MATH  Google Scholar 

  • Salassa F, Vanden Berghe G (2012, August) A stepping horizon view on nurse rostering. In: Proceedings of the 9th international conference on the practice and theory of automated timetabling, pp 161–173

  • Santos HG, Toffolo TA, Gomes RA, Ribas S (2016) Integer programming techniques for the nurse rostering problem. Ann Oper Res 239(1):225–251

    Article  MathSciNet  Google Scholar 

  • Savage LJ (1972) The foundations of statistics. 2nd revised ed. Dover Publications, New York

    MATH  Google Scholar 

  • Shukla R, Hazela B, Shukla S, Prakash R, Mishra KK (2017) Variant of differential evolution algorithm. In: Bhatia S, Mishra K, Tiwari S, Singh V (eds) Advances in computer and computational sciences. Advances in intelligent systems and computing, vol 553. Springer, Singapore. https://doi.org/10.1007/978-981-10-3770-2_56

  • Tanzi V, Schuknecht L (2000) Public spending in the 20th century: a global perspective, 1nd edn. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Turhan AM, Bilgen B (2020) A hybrid fix-and-optimize and simulated annealing approaches for nurse rostering problem. Comput Ind Eng 145:106531

    Article  Google Scholar 

  • Van den Bergh J, Beliën J, De Bruecker P, Demeulemeester E, De Boeck L (2013) Personnel scheduling: a literature review. Eur J Oper Res 226(3):367–385

    Article  MathSciNet  Google Scholar 

  • Wickert TI, Smet P, Vanden Berghe G (2019) The nurse rerostering problem: strategies for reconstructing disrupted schedules. Comput Oper Res 104:319–337

    Article  MathSciNet  Google Scholar 

  • Xidonas P, Mavrotas G, Hassapis C, Zopounidis C (2017) Robust multiobjective portfolio optimization: a minimax regret approach. Eur J Oper Res 262(1):299–305

    Article  MathSciNet  Google Scholar 

  • Yang S, Jat SN (2011) Genetic algorithms with guided and local search strategies for university course timetabling. IEEE Trans Syst Man Cybern Part C (Appl Rev) 41(1):93–106

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran

    Mohammad Reza Hassani & J. Behnamian

Authors
  1. Mohammad Reza Hassani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Behnamian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Behnamian.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hassani, M.R., Behnamian, J. A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. J Comb Optim 41, 143–169 (2021). https://doi.org/10.1007/s10878-020-00667-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00667-0

Keywords

Search

Navigation