Document Type : Research Paper


Department of Industrial Engineering, Yazd University, Yazd, Iran.


Due to the importance of the health field, the problem of determining the shift scheduling of care providers has been addressed in many studies, and various methods have been proposed to solve it. Considering different skills and contracts for care providers is one of the essential issues in this field. Given the uncertainty in patients' demands, it is a crucial issue as to how to assign care providers to different shifts. One area facing this uncertainty is the provision of services to cancer patients. This study develops a stochastic programming model to account for patient demand uncertainty by considering different skills and contracts for care providers. In the first step, care providers are assigned to work shifts, then, in the second step, the required overtime hours are determined. The sample average approximation method is presented to determine an optimal schedule by minimizing care providers' regular and overtime costs with different contracts and skills. Then, the appropriate sample size is 100, determined based on the Monte Carlo and Latin Hypercube methods. In the following, the lower and upper bounds of the optimal solution are calculated. As the numerical results of the study show, the convergence of the lower and upper bounds of the optimal solution is obtained from the Latin Hypercube method. The best solution is equal to 189247.3 dollars and is achieved with a difference of 0.143% between the upper bound and lower bounds of the optimal solution. The Monte Carlo simulation method is used to validate the care provider program in the next stage. As shown, in the worst case, the value of the objective function is equal to 197480 dollars.


Main Subjects

[1]     Zurn, P., Dolea, C., & Stilwell, B. (2005). Nurse retention and recruitment: developing a motivated workforce.
[2]     Niksirat, M., & Nasseri, S. H. (2021). Forecasting of the number of cases and deaths due to corona disease using neuro-fuzzy networks. Journal of decisions and operations research, 5(4), 414-425. (In Persian).
[3]     Ghasemi, S., Aghsami, A., & Rabbani, M. (2021). Data envelopment analysis for estimate efficiency and ranking operating rooms: a case study. International journal of research in industrial engineering, 10(1), 67–86.
[4]     Salehi-Kordabadi, S., Godarzvand Chegini, M., Ismaeilpoor, S., & Zad-Dousti, F. (2021). Human resource management activities and organizational commitment among the engineers and technical technicians of the electricity company. Innovation management and operational strategies, 2(1), 79–95. (In Persian).
[5]     Lagatie, R., Haspeslagh, S., De Causmaecker, P., Calders, T., Tuyls, K., & Pechenizkiy, M. (2009). Negotiation protocols for distributed nurse rostering [presentation]. Proceedings of the 21st benelux conference on artificial intelligence (pp. 145–152).
[6]     Ejegwa, P. A., & Onyeke, I. C. (2020). Medical diagnostic analysis on some selected patients based on modified Thao et al.’s correlation coefficient of intuitionistic fuzzy sets via an algorithmic approach. Journal of fuzzy extension and applications, 1(2), 122–132.
[7]     De Causmaecker, P., & Vanden Berghe, G. (2011). A categorisation of nurse rostering problems. Journal of scheduling, 14, 3–16.
[8]     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, 153(1), 3–27.
[9]     Klinz, B., Pferschy, U., & Schauer, J. (2007). ILP models for a nurse scheduling problem. Operations research proceedings 2006 (pp. 319–324). Springer, Berlin, Heidelberg.
[10]   Topaloglu, S., & Selim, H. (2010). Nurse scheduling using fuzzy modeling approach. Fuzzy sets and systems, 161(11), 1543–1563.
[11]   Landa-Silva, D., & Le, K. N. (2008). A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling. Adaptive and multilevel metaheuristics, 133-155.
[12]   Ohki, M. (2012). Effective operators using parallel processing for nurse scheduling by cooperative genetic algorithm. International journal of data mining, modelling and management, 4(1), 57–73.
[13]   Zhang, Z., Hao, Z., & Huang, H. (2011). Hybrid swarm-based optimization algorithm of GA & VNS for nurse scheduling problem. Information computing and applications: second international conference (ICICA) (pp. 375-382). Springer Berlin Heidelberg.
[14]   Maenhout, B., & Vanhoucke, M. (2013). An integrated nurse staffing and scheduling analysis for longer-term nursing staff allocation problems. Omega, 41(2), 485–499.
[15]   Santos, H. G., Toffolo, T. A. M., Gomes, R. A. M., & Ribas, S. (2016). Integer programming techniques for the nurse rostering problem. Annals of operations research, 239, 225–251.
[16]   Ingels, J., & Maenhout, B. (2015). The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation. Computers & operations research, 61, 153–169.
[17]   Bagheri, M., Gholinejad Devin, A., & Izanloo, A. (2016). An application of stochastic programming method for nurse scheduling problem in real word hospital. Computers & industrial engineering, 96, 192–200.
[18]   Punnakitikashem, P., Rosenberber, J. M., & Buckley-Behan, D. F. (2013). A stochastic programming approach for integrated nurse staffing and assignment. IIE transactions, 45(10), 1059–1076.
[19]   Chen, P. S., Lin, Y. J., & Peng, N. C. (2016). A two-stage method to determine the allocation and scheduling of medical staff in uncertain environments. Computers & industrial engineering, 99, 174–188.
[20]   Ang, B. Y., Lam, S. W. S., Pasupathy, Y., & Ong, M. E. H. (2018). Nurse workforce scheduling in the emergency department: a sequential decision support system considering multiple objectives. Journal of nursing management, 26(4), 432–441.
[21]   Hamid, M., Tavakkoli-Moghaddam, R., Golpaygani, F., & Vahedi-Nouri, B. (2019). A multi-objective model for a nurse scheduling problem by emphasizing human factors. Proceedings of the institution of mechanical engineers, part H: journal of engineering in medicine, 234(2), 179–199.
[22]   Hassani, M. R., & Behnamian, J. (2021). A scenario-based robust optimization with a pessimistic approach for nurse rostering problem. Journal of combinatorial optimization, 41(1), 143–169.
[23]   Kheiri, A., Gretsista, A., Keedwell, E., Lulli, G., Epitropakis, M. G., & Burke, E. K. (2021). A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Computers & operations research, 130, 105221.
[24]   Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations research, 52(1), 35–53.
[25]   Birge, J. R., & Louveaux, F. (2011). Introduction to stochastic programming. Springer New York, NY.
[26]   Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002). The sample average approximation method for stochastic discrete optimization. SIAM journal on optimization, 12(2), 479–502.
[27]   Verweij, B., Ahmed, S., Kleywegt, A. J., Nemhauser, G., & Shapiro, A. (2003). The sample average approximation method applied to stochastic routing problems: a computational study. Computational optimization and applications, 24, 289–333.
[28]   Santoso, T., Ahmed, S., Goetschalckx, M., & Shapiro, A. (2005). A stochastic programming approach for supply chain network design under uncertainty. European journal of operational research, 167(1), 96–115.
[29]   Pagnoncelli, B. K., Ahmed, S., & Shapiro, A. (2009). Sample average approximation method for chance constrained programming: theory and applications. Journal of optimization theory and applications, 142(2), 399–416.
[30]   Mak, W. K., Morton, D. P., & Wood, R. K. (1999). Monte Carlo bounding techniques for determining solution quality in stochastic programs. Operations research letters, 24(1-2), 47-56.
[31]   McKay, M. D., Beckman, R. J., & Conover, W. J. (1979). Comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics, 21, 239–245.