A Hybrid Genetic Algorithm for Nurse Scheduling Problem considering the Fatigue Factor

Amindoust, Atefeh; Asadpour, Milad; Shirmohammadi, Samineh

doi:https://doi.org/10.1155/2021/5563651

Journal of Healthcare Engineering

On this page

Abstract Introduction Literature Review Conclusion Appendix Data Availability Conflicts of Interest References Copyright Related Articles

Special Issue

Computational Decision-Making Tools for Healthcare

View this Special Issue

Research Article | Open Access

Volume 2021 | Article ID 5563651 | https://doi.org/10.1155/2021/5563651

A Hybrid Genetic Algorithm for Nurse Scheduling Problem considering the Fatigue Factor

Atefeh Amindoust,¹Milad Asadpour,^1,2and Samineh Shirmohammadi³

Academic Editor: Giovanni Improta

Received20 Jan 2021

Revised26 Feb 2021

Accepted14 Mar 2021

Published01 Apr 2021

Abstract

Nowadays and due to the pandemic of COVID-19, nurses are working under the highest pressure benevolently all over the world. This urgent situation can cause more fatigue for nurses who are responsible for taking care of COVID-19 patients 24 hours a day. Therefore, nurse scheduling should be modified with respect to this new situation. The purpose of the present research is to propose a new mathematical model for Nurse Scheduling Problem (NSP) considering the fatigue factor. To solve the proposed model, a hybrid Genetic Algorithm (GA) has been developed to provide a nurse schedule for all three shifts of a day. To validate the proposed approach, a randomly generated problem has been solved. In addition, to show the applicability of the proposed approach in real situations, the model has been solved for a real case study, a department in one of the hospitals in Esfahan, Iran, where COVID-19 patients are hospitalized. Consequently, a nurse schedule for May has been provided applying the proposed model, and the results approve its superiority in comparison with the manual schedule that is currently used in the department. To the best of our knowledge, it is the first study in which the proposed model takes the fatigue of nurses into account and provides a schedule based on it.

1. Introduction

In working places such as hospitals where the services must be provided continuously, distribution of workforces within different shifts is required. Accordingly, different studies could be found within the literature which formulated the problem of scheduling nurses, known as the Nurse Scheduling Problem (NSP), from different aspects to provide a timetable for nurses in a hospital [1–3].

In NSP, nurses are assigned different shifts according to a set of constraints and requirements which are determined by the hospital. On one hand, optimal nurse scheduling has effects on reducing hospital costs, increasing nurse’s job satisfaction, quality of care, and increasing the input budget of hospitals [4]. On the other hand, hospital work shifts could impose negative effects on involved nurses such as understaffing, heavy workload, and irregular work-scheduling conditions. It adversely affects the service quality of healthcare operations and leads to less patient-nurse interaction and patient safety issues. Meanwhile, other negative impacts of shift works on nurses are important such as fatigue, obesity, sleep disorder, and a wide range of chronic diseases [5–8]. It seems that human factors should be combined with NSP if a more productive hospital is needed. In other words, studying NSP considering human factors could improve both the performance of nurses and productivity of hospitals significantly [9].

In addition to former issues in nurses’ work shifts, the pandemic of the COVID-19 has aggravated the problem and put double pressure on nurses across the world. In this new situation, work shifts should be determined regarding response to patients’ care requirements effectively and immediately and reduction of nurses’ fatigue simultaneously.

Motivated by the aforementioned issues, and since, to the best of our knowledge, formulating an NSP considering fatigue factor has not studied yet, in this study, we have suggested a framework to distribute nurses in work shifts with the least fatigue alongside an attention to the additional pressure due to COVID-19 pandemic. To do so, a mathematical model is formulated for NSP in which fatigue of nurses has been taken into account. To solve the proposed model, a hybrid Genetic Algorithm (GA) has been developed, and real data from a department in one of the hospitals in Esfahan, Iran, where COVID-19 patients are hospitalized, has been used to provide a timetable for May.

The remaining parts of the current paper are as follows.

Firstly, related previous work on the area of NSP is investigated. After that, the problem is described and formulated, and then, the proposed GA is introduced. Following this, test problems are solved to approve the accuracy of the proposed model. Next, a real case study is considered, and a timetable for the department of COVID-19 patients is provided. Also, results are compared with the current timetable which is scheduled manually. Finally, the most important results along with suggestions for future research are presented in the conclusion section.

2. Literature Review

Taking preferences into account has been studied in NSP from different points of view. For instance, in the NSP study of Tsai and Li [10], Topaloglu and Selim [11], Abdollahi and Ansari [12], Wong et al. [13], Jafari et al. [14], and Legrain et al. [15], shift preferences were considered while in Vanhoucke and Maenhout [16] both shift preferences and day preferences were integrated simultaneously. Also, Liu et al. [17] considered NSP in hemodialysis service with a preference on roles and shifts. Further, Hamid et al. [9] proposed a multiobjective model for NSP considering the skill, preference, and compatibility of nurses.

In addition to preferences, some papers have added social/human factors into the NSPs. For example, in Farasat and Nikolaev [18], social structure effects into Nurse Scheduling Problem (NSP) were considered, and it was shown how the social structure of the working environment can affect the performance of nurses. In Zanda et al. [19], the maternity of nurses, type of their contracts (full time or part time), or nurses that benefit from special reductions of the workload for several reasons (e.g., because they have a close relative who suffers a serious illness) have been taken into account in providing a nurse schedule. Nahand et al. [20] proposed a multiobjective model for NSP considering human errors of nurses to determine optimal shift scheduling of nurses. Particularly, nurses’ preference score, allocation costs, penalty cost of violating soft constraints, and human errors were all considered as objectives to be optimized, and a weighted-sum method was employed to solve the model. Wolbeck et al. [21] proposed a model for the NSP considering the timing and distribution of shift changes among nurses. In fact, the model incorporates a fair shift change penalization scheme, in which the type, timing, and distribution of shift changes among nurses are taken into account. In addition, information from previous periods was considered, using an individual penalty score to distribute the shift changes fairly among the nurses. The model was solved within the Gurobi software.

Assigning nurses to the operating room is the subject of another group of papers in the NSP literature. Lim et al. [22] presented two models for NSP. The first one assigns nurses to upcoming surgery cases while the second one assigns lunch breaks for nurses. A column generation algorithm and a two-phase swapping heuristic were developed to find feasible assignments in a fast manner. In another study, Di Martinelly and Meskens [23] proposed a biobjective model for NSP to assign nurses to operating rooms. They have used the e-constraint method to solve the problem. Besides, Chiang et al. [24] presented a mathematical model which can provide an optimized schedule for nurses and operating rooms simultaneously. GAMS software was deployed to solve the proposed model.

Also, categorizing patients into different groups and then assigning nurses to each group of them have been studied in NSPs as well. In particular, Heshmat et al. [25] studied a two-stage approach where, at the first stage, patients are clustered, and then, at the second stage, nurses are assigned to each cluster. The model was solved by using CPLEX. Moreover, Sarkar et al. [26] proposed a framework to assign nurses to home patients and patients in the hospital according to different demands with respect to the patients’ health status. A hybrid GA was applied to solve the problem.

Meanwhile, the possibility of exchanging nurses within different departments has also been investigated. Fügener et al. [27] proposed a mid-term model for NSP considering cross-training effects. Firstly, a framework to define and visualize cross-training policies was proposed. Next, a new cross-training policy was introduced where each unit trained one dedicated nurse for each other unit, and finally, by using CPLEX for solving the model, a schedule was provided. He et al. [28] proposed a two-stage stochastic model for NSP considering understaffing risk control. In the proposed model, an initial base number of nurses within the department’s budget were assigned to the department. However, a central pool of nurses was maintained from where extra nurse shifts can be transferred from the pool to cover the shortage in certain departments, or redundant nurse shifts can be transferred into the pool. The model was solved using CPLEX. Schoenfelder et al. [29] presented a model that incorporates two classes of quick-response decisions in hospitals’ nurse scheduling, namely, adjustments to the unit assignments of cross-trained float nurses and transfers of patients between units and off-unit admissions. They have examined the proposed model within different hospitals.

However, the main purpose of some papers is to develop heuristic/metaheuristic/simulation-based approaches for solving NSPs with the aim of improving the solution procedures from both quality and CPU time. In this case, hybrid Artificial Bee Colony (Awadallah et al. [30]), Particle Swarm Optimization (Wu et al. [31]), Sample Average Approximation method (Bagheri et al. [32]), Variable Neighborhood Search algorithm (Zheng et al. [33], Rahimian et al. [34]), Hybrid Harmony Search algorithm (Awadallah et al. [35]), a heuristic approach based on Simulated Annealing (Knust and Xie [36]), a combination of three algorithms, namely, Fix-and-Relax, Fix-and-Optimize, and Simulated Annealing (Turhan and Bilgen [37]), and a heuristic procedure based on column generation (Strandmark et al. [38]) could be found within the literature of NSP.

According to a comprehensive literature review, we did not find any research which formulated NSP considering fatigue factor. To fill this research gap and to decrease double pressure which has been imposed on nurses due to the spreading of COVID-19, in the current paper, we formulated the NSP by considering the fatigue factor for a real case study, a department in one of the hospitals in Esfahan, Iran, where COVID-19 patients are hospitalized, to provide a schedule for nurses of this department for May in all shifts.

3. Problem Description

Health organizations such as hospitals are responsible for providing required services in both normal and crisis situations [39–41]. In recent years, health management has received special attention among researchers since appropriate allocation and usage of resources are vital to provide high-quality services to patients [42]. Accordingly, researchers in conjunction with decision-makers have worked on health management (as a pivotal issue in many political and social debates) in different regions and countries across the world to select an optimal form for the usage of healthcare resources [43]. To do so, they have applied novel decision-making tools to allocate and productive usage of resources [44] since the quality of the provided services to patients is highly dependent on the available resources. Among required resources, human resources are the most important factor in providing services [45, 46]. Because staff costs are a heavy part of each organization's cost, increasing the productivity and efficiency of human resources is very significant. One of the most practical ways to increase the productivity of this valuable resource is to combine the right distribution of human resources [47, 48]. In other words, it is very important to determine the number of required nurses during each shift so that, depending on the volume of arrivals, the provision of services always remains at the desired level. There are different types of shifts such as night shifts, last week shifts, two-part shifts, and on-call shifts. However, work shifts should be scheduled in such a way that imposes the lowest fatigue on nurses because long shifts have a negative efficacy on employee physiology. To do so, we propose a multiobjective model for the Nurse Scheduling Problem to optimize the work shifts of nurses, which includes three shifts in the morning, evening, and night. The first objective function is minimizing the total costs while the second objective function is minimizing the expected value of total fatigue for all nurses in all shifts. In fact, in this model, since fatigue is one of the main human factors which affects the quality of doing jobs and health circumstances of employees, the nurse fatigue factor has been investigated as a function with binary values according to break times which makes a virtual life for nurses. In simple words, to reduce nurses’ fatigue during the shifts, some certain times are allocated for their break.

Some of the assumptions of the problem are as follows:(i)All nurses have identical skills(ii)The break times are discrete values(iii)Demand behavior is the random variable based on a specific distribution function(iv)Each nurse is only assigned one shift(v)The break time is more important compared with shift time

3.1. Sets and Parameters

: Period (day) : Rest time (break time) : Employment cost : Dismissal cost : Nurse shortage cost : Nurse surplus cost : Fatigue reduction cost : Duration of the rest time j at period i : Duration of the shift time at period i : Interval between the breaks at period i : Maximum fatigue level : positive value : positive value : A very large number

3.2. Decision Variables and Functions

: Nurse level changes at period i : Rest level (integer positive values use for determining rest time) : Required nurse number : Nursing attendance virtual time based on rest time j at period i : Probability function of required nurse number : Fatigue function : Fatigue fix function : Nurses’ fatigue reduction function at period i : A binary variable, which is equal to 1 if nurse’s employment is required; 0, otherwise : A binary variable, which is equal to 1 if nurse’s dismissal is required; 0, otherwise

3.3. Model Formulation

subject to

Equations (1) and (2) are objective functions of the proposed model. The first objective function minimizes the total cost of nurses. The first sentence of this function relates to nurses’ fatigue reduction function at period i. The second and third sentences of the first objective function calculate the costs related to decisions about the increase or reduction in the number of nurses in each shift. Finally, the fourth and fifth sentences of the first objective function determine the number of shortages and surplus of nurses at period i. Equation (2) is the second objective function and minimizes the expected value of total fatigue for all nurses in all shifts. Appendix A provides some complementary relations and explanations about these objective functions.

Also, constraints of the proposed model have been formulated as equations (3)–(7). Constraint (3) shows nursing attendance virtual time at period i. Constraint (4) determines a lower bound and upper bound for nurse level changes at period i. Constraint (5) assures that in each period solely either nurse employment or nurse dismissal could occur. Finally, constraints (6) and (7) define the domains of the decision variables.

3.4. Linearization

The above-proposed model is nonlinear because of constraint (5). Therefore, before proceeding to the next stage, constraint (5) should be substituted with identical linear equations. To do so, equations (8)–(10) should be used:

4. Solution Approach

Genetic Algorithm (GA) is one of the first Evolutionary Algorithms in which selection, crossover, and mutation are its main operators. The idea behind the GA originates from the Darwinian Theory of Evolutionary and, therefore, GA is categorized as a population-based algorithm. It can be said that the GA is a programming technique that uses genetic evolution as a pattern for solving problems. The GA algorithm starts with a random population. This population contains a set of solutions, which represent chromosomes of individuals. The next step is creating the second generation of the population based on selection processes, i.e., generation based on the selected characteristics by genetic operators. For each individual, a pair of parents is selected. In the selection stage, the most appropriate elements will be selected so that even the weakest elements have the chance to choose. This process prevents from nearing the local answer.

Generally, GA has a connectivity probability that is between 0.6 and 1, which indicates the probability of birth of a child, and the organisms combine with this possibility. The connection of two chromosomes creates the child, which is added to the next generation. This process is done to find the right candidates for the answer in the next generation. This process creates a new generation of chromosomes that are different compared with the previous generation. The whole process is repeated until the last stage [49].

In comparison with other optimization algorithms, GA has certain advantages. The most important one is that GA has a powerful ability to tackle complex problems and could be used for solving a wide variety of optimization problems with different objective functions (e.g., stationary or nonstationary objective functions, linear or nonlinear objective functions, etc.). Moreover, since “multiple off-springs in a population act like independent agents, the population (or any subgroup) can explore the search space in many directions simultaneously. This feature makes it ideal to parallelize the algorithms for implementation while different parameters and even different groups of encoded strings can be manipulated at the same time” [50].

Due to the aforementioned advantages, in this study, a hybrid GA algorithm is applied to solve the proposed NSP model. Figure 1 shows the steps of the GA algorithm. Also, Appendix B provides more detail about the applied GA algorithm.

5. Computational Results

5.1. Model Validation

Prior to solving the model by using real data, to validate the accuracy of the proposed model, a test problem is generated randomly and a schedule for one week is provided. Table 1 includes parameters for the test problem. All computations have been done within MATLAB software on a laptop with Intel Core i5, 2.5 GHz, and 4 GB of RAM.

The number of nurses is assumed to be five, and there are three shifts per day. Each nurse’s salary per hour is also assumed to be 10 units per hour.

Table 2 shows the obtained schedule for a week for the test problem.

In Table 2, columns and show the required changes in the number of nurses so that the value in column D is affected by these changes in each row. Also, column F1 contains the imposed cots to the system by implementing the schedule whereas column F2 shows the fatigue of nurses.

5.2. Case Study

After validating the proposed model, we performed the model in a real case, a specific department of a hospital in Esfahan, Iran, where COVID-19 patients are hospitalized. Our purpose was to compare the scheduling obtained using the proposed model with those currently used in the considered department which have been computed manually by a person in the human resource department of the case study. Due to the nature of constraints in the NSP of the case study, the person who is responsible for providing the schedule, firstly, arranges an initial schedule that distributes all nurses within the days of a month. After that, she/he tries to rearrange the scheduling in order to also meet the fatigue of nurses as well. Accordingly, administrators of the department noted that the manual approach could be very time-consuming. In addition, some nurses were enjoying generous rest hours while most nurses were under high pressure. Thereby, administrators decided to automate the scheduling of this department. It led to the distribution of nurses within the shifts in a fair manner while the required time for providing a schedule was reduced significantly as well.

The department has 14 nurses, and working days are partitioned into three shifts: 8: 00 am-4: 00 pm, 4: 00 pm-12: 00 pm (0: 00 am), and 12: 00 pm-8: 00 am. Each nurse’s salary per hour is 160000 IRR. It is worth mentioning that 1 EUR is equal to almost 46,292 IRR. Based on the salary, costs of employment, dismissal, shortage and, surplus are as follows:`

The patient’s arrival rate is based on the Poisson distribution and is , , and in the first, second, and third shifts. The fatigue factor follows the Weibull distribution with parameters ß = 2 and θ = 500. Also, the parameters of the hybrid GA algorithm including the percentage of mutation, intersection percentage, and the number of repetitions are 0.1, 0.9, and 200, respectively. The model is solved within MATLAB software on a laptop with Intel Core i5, 2.5 GHz, and 4 GB of RAM.

The schedule for May which has been prepared manually and the schedule that has been prepared by hybrid GA have been compared in Table 3. In Table 3, column D depicts the order of each shift in each day. For instance, 6 3 3 on the 1st day of May states that, on the first day of May, the number of required nurses for the first, second, and third shifts is six, three, and three, respectively. In addition, columns and depict the level of changes required for each day regarding the last day. For example, on the 25th of May, one nurse should be added for a second shift whereas one nurse should be eliminated in the first shift compared with the 24^th of May. Therefore, the order of shifts on the 25th of May is 5 3 1 while on the 24^th of May the order was 6 2 1.

Column m presents the rest level at each shift. The value of 0 means that nurses will not be allowed to have further rest during their shift. In fact, all nurses have a break time generally in their shifts. If this usual break is the only break during the shift, m will give a value of 0. However, values of 1 and 2 for m state that nurses have one or two further breaks during their shift. Undoubtedly, the surplus break times reduce the fatigue of nurses dramatically.

Finally, columns F1 and F2 contain the value of costs and fatigue function in each day. It should be mentioned that F1 values have been divided into 1,000 for more convenience.

Figure 2 compares costs of manual scheduling and scheduling calculated by hybrid GA algorithm for all 31 days in May.

As Figure 2 illustrates, the costs of the department during one month according to manual scheduling are lower than those of the hybrid GA algorithm. However, this difference is not very significant, and Figure 3 clearly approves this matter. As it can be seen in Figure 3, the total costs of manual scheduling are 2,212,461,000 IRR while the total costs of scheduling which have been prepared by the proposed model and using the hybrid GA algorithm are 2,214,349,000 IRR. Therefore, the difference between costs is not higher than 2,000,000 IRR, and actually, this is not a considerable amount of money.

Figure 4 compares fatigue function in manual scheduling and hybrid GA scheduling.

Figure 4 clearly reveals that although the values of fatigue function in the second decade of May are almost identical in both hybrid GA scheduling and manual scheduling, the fatigue of nurses in hybrid GA scheduling is totally lower than that in manual scheduling. Figure 5 which shows cumulative values of fatigue function for 31 days of May obviously approves this clime.

In addition, the required total time for providing a timetable by hybrid GA is considerably lower than the required total time for providing a timetable manually. Figure 6 depicts this difference.

Figure 6 illustrates that scheduling of the department manually takes 66.67 minutes whereas the hybrid GA algorithm reduces the required time for scheduling dramatically so that it needs just 1.28 minutes for solving the proposed model and providing a timetable for the department.

6. Conclusion

Scheduling work shifts in many industry and service occupations directly affects the mental and physical health of employees. This matter can be more obvious in occupations like nursing where employees are usually working under high pressure and stress. Therefore, it would be better to consider employees’ satisfaction and convenience in providing scheduling so that work hours impose lower pressure on them.

During the last months and due to the pandemic of COVID-19, physicians, nurses, and other persons in hospitals across the world are working under the highest pressure benevolently to suppress this insidious disease. This urgent situation can cause more fatigue for these persons, especially for nurses who are caring for COVID-19 patients 24 hours a day. Therefore, nurse scheduling should be modified with respect to this new situation.

In this paper, a mathematical model has been proposed to optimize the work shift of nurses considering human factors. To do so, according to experts’ points of view, fatigue as the most important factor among human factors has been selected, and minimizing fatigue by creating different time intervals of rest during shift works has been addressed.

To solve the proposed model, a hybrid GA algorithm has been performed. In addition, to validate the efficiency of the proposed model, real data from the department of COVID-19 patients in one of the hospitals in Esfahan have been used where scheduling is currently determined manually. In fact, applying the proposed procedure of this paper, a timetable for all shifts of this department has been provided for May, and results have been compared with those currently used in the considered department and provided manually. Results approve that while the proposed approach imposes a little more cost to the department, it outperforms the current manual scheduling in both fatigue factor and time of providing a time table.

Apart from the lower required time for providing a timetable compared with the former manual approach, one of the main advantages of the proposed approach is eliminating personal tastes. It has been done because in the proposed approach, no one is involved in providing schedules, and the level of available resources is the only effective factor on the final schedule. To sum up, the proposed approach distributes nurses within the shifts in a fair manner considering the least fatigue while the required time for providing a schedule is significantly lower than the manual approach as well. However, another strength of our proposed approach is its generalizability. In other words, due to the structure of formulation, the proposed model could be used in either other healthcare departments or other continuous systems where a schedule for different shifts is required. In all of these settings, the model could distribute nurses/workforces within different shifts fairly considering least fatigue.

In future research, our model can be developed by considering other human factors such as rewards, motivation, and loyalty. Also, developing other heuristic and metaheuristic techniques would be an interesting direction for future research.

Appendix

A. Complementary Relations

As mentioned in Section 3.3, the first objective function minimizes the total cost of nurses. The first sentence of this function relates to nurses’ fatigue reduction function at period i which is calculated based on equation (A.1):

The second and third sentences of the first objective function calculate the costs related to decisions about the increase or reduction in the number of nurses in each shift. In other words, depicts the number of employed nurses while shows the number of dismissed nurses at period i. Finally, the fourth and fifth sentences of the first objective function determine the number of shortages and surplus of nurses at period i. On the one hand, when demand is higher than the number of nurses , the cost of shortage could be computed as follows:

On the other hand, when demand is less than the number of nurses , the cost of the surplus could be computed as follows:

It should be noted that is computed based on equation (A.4) and (A.5):

Since D is a Poisson random variable, in equations (A.2) and (A.3) is a Poisson distribution function. Therefore, equations (A.2) and (A.3) should be rewritten as the following equations:

Moreover, as mentioned in Section 3.3, the proposed model has a second objective function which minimizes the expected value of total fatigue for all nurses in all shifts. In the current objective function, there are some values that will be calculated using the following equations:

B. Steps of the Hybrid GA Algorithm

1) Generating Initial Answer

Since there are four variables including and three shifts, all feasible solutions will be revealed in the form of a 4 × 3 matrix. A feasible answer can be found as follows:

An initial answer will be generated randomly. For this purpose, one of the first or second rows is selected randomly. To fill the first column, a random number between is selected. If the selected number is greater than zero, we will write a zero in the next row while if the selected number is zero, a random number in the interval will be selected for another row. The same procedure will be employed for the second and third columns as well. In the third row, a random number in the interval opts for the first to third columns respectively.

2) Fitness Function

Suppose and . The fitness function is calculated according to these functions and will put in the Pareto set.

3) Generating New Answer Based on Different Neighborhood Structures

The first neighborhood structure is as follows: Between the first and second rows, one of them is chosen randomly. Suppose that represents the selected row. Now a random column like is chosen randomly. If, then and the value of column j in the next row is zero. The second neighborhood structure: Between the first and second rows, one of them is chosen randomly. Suppose that represents the selected row. Now, a random column like is chosen randomly. If , then . The third neighborhood structure: In the third row, a column is chosen randomly. If , then, . The fourth neighborhood structure: In the third row, a column is chosen randomly. If , then, . The algorithm starts with the first neighborhood structure. The answer is added to the Pareto set; therefore, the current neighborhood structure remained. Otherwise, go to the next neighborhoods’ structure. It should be mentioned that once the newly generated answer is entered into the Pareto set, the algorithm starts with the first neighborhood structure again. In this situation, the algorithm replicates the search process for times.

4) Evaluating the New Generated Answer

In the evaluation stage of the new generated answer, one of the following states should occur: First state If for the new answers, in all answers of the dominant set, are worse, or one of them is worse and another is equal, it is not allowed to enter the dominant answer set. Second state The new answer is better than answers of the dominant answer set. So, the new answer is added to the dominant set, and nondominant answers will be eliminated. Third state The new answer is not better than any answers of the dominant answer set. Meanwhile, if one of the functions or is superior to all answers of the dominant answer set, it will enter into the Pareto set. However, other answers will remain in the dominant answer as well.

5) Replicating Algorithm

Steps 1 to 3 are replicated for times.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

A. Müller, M. Weigl, B. Heiden, B. Herbig, J. Glaser, and P. Angerer, “Selection, optimization, and compensation in nursing: exploration of job-specific strategies, scale development, and age-specific associations to work ability,” Journal of Advanced Nursing, vol. 69, no. 7, pp. 1630–1642, 2013.
View at: Publisher Site | Google Scholar
V. G. Kulkarni, Modeling and Analysis of Stochastic Systems, Chapman and Hall/CRC, Boca Raton, FL, USA, 2016.
A. A. Rajaee, A. Amindoust, and M. Asadpour, “Applying simulated annealing algorithm for parallel machine tardiness problem subject to job splitting,” in Proceedings of the 48th International Conference on Computers & Industrial Engineering (CIE48), pp. 2–5, Auckland, New Zealand, December 2018.
View at: Google Scholar
J. Puente, A. Gómez, I. Fernández, and P. Priore, “Medical doctor rostering problem in a hospital emergency department by means of genetic algorithms,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1232–1242, 2009.
View at: Publisher Site | Google Scholar
P. Rerkjirattikal, V. N. Huynh, S. Olapiriyakul, and T. Supnithi, “A goal programming approach to nurse scheduling with individual preference satisfaction,” Mathematical Problems in Engineering, vol. 2020, Article ID 2379091, 11 pages, 2020.
View at: Publisher Site | Google Scholar
J. Bridges, P. Griffiths, E. Oliver, and R. M. Pickering, “Hospital nurse staffing and staff-patient interactions: an observational study,” BMJ Quality & Safety, vol. 28, no. 9, pp. 706–713, 2019.
View at: Publisher Site | Google Scholar
L.-F. Liu, S. Lee, P.-F. Chia, S.-C. Chi, and Y.-C. Yin, “Exploring the association between nurse workload and nurse-sensitive patient safety outcome indicators,” Journal of Nursing Research, vol. 20, no. 4, pp. 300–309, 2012.
View at: Publisher Site | Google Scholar
J. A. Baker, K. Canvin, and K. Berzins, “The relationship between workforce characteristics and perception of quality of care in mental health: a qualitative study,” International Journal of Nursing Studies, vol. 100, Article ID 103412, 2019.
View at: Publisher Site | Google Scholar
M. Hamid, R. Tavakkoli-Moghaddam, F. Golpaygani, and B. Vahedi-Nouri, “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, vol. 234, no. 2, pp. 179–199, 2020.
View at: Publisher Site | Google Scholar
C.-C. Tsai and S. H. A. Li, “A two-stage modeling with genetic algorithms for the nurse scheduling problem,” Expert Systems with Applications, vol. 36, no. 5, pp. 9506–9512, 2009.
View at: Publisher Site | Google Scholar
S. Topaloglu and H. Selim, “Nurse scheduling using fuzzy modeling approach,” Fuzzy Sets and Systems, vol. 161, no. 11, pp. 1543–1563, 2010.
View at: Publisher Site | Google Scholar
S. M. Abdollahi and Z. Ansari, “A data-driven goal programming model for the nurse scheduling problem,” International Journal of Experimental Design and Process Optimisation, vol. 3, no. 3, pp. 294–310, 2013.
View at: Publisher Site | Google Scholar
T. C. Wong, M. Xu, and K. S. Chin, “A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department,” Computers & Operations Research, vol. 51, pp. 99–110, 2014.
View at: Publisher Site | Google Scholar
H. Jafari, S. Bateni, P. Daneshvar, S. Bateni, and H. Mahdioun, “Fuzzy mathematical modeling approach for the nurse scheduling problem: a case study,” International Journal of Fuzzy Systems, vol. 18, no. 2, pp. 320–332, 2016.
View at: Publisher Site | Google Scholar
A. Legrain, J. Omer, and S. Rosat, “An online stochastic algorithm for a dynamic nurse scheduling problem,” European Journal of Operational Research, vol. 285, no. 1, pp. 196–210, 2020.
View at: Publisher Site | Google Scholar
M. Vanhoucke and B. Maenhout, “On the characterization and generation of nurse scheduling problem instances,” European Journal of Operational Research, vol. 196, no. 2, pp. 457–467, 2009.
View at: Publisher Site | Google Scholar
Z. Liu, Z. Liu, Z. Zhu, Y. Shen, and J. Dong, “Simulated annealing for a multi-level nurse rostering problem in hemodialysis service,” Applied Soft Computing, vol. 64, pp. 148–160, 2018.
View at: Publisher Site | Google Scholar
A. Farasat and A. G. Nikolaev, “Signed social structure optimization for shift assignment in the nurse scheduling problem,” Socio-Economic Planning Sciences, vol. 56, pp. 3–13, 2016.
View at: Publisher Site | Google Scholar
S. Zanda, P. Zuddas, and C. Seatzu, “Long term nurse scheduling via a decision support system based on linear integer programming: a case study at the University Hospital in Cagliari,” Computers & Industrial Engineering, vol. 126, pp. 337–347, 2018.
View at: Publisher Site | Google Scholar
P. K. Nahand, M. Hamid, M. Bastan, and A. Mollajan, “Human resource management: new approach to nurse scheduling by considering human error,” International Journal of System Assurance Engineering and Management, vol. 10, no. 6, pp. 1429–1443, 2019.
View at: Google Scholar
L. Wolbeck, N. Kliewer, and I. Marques, “Fair shift change penalization scheme for nurse rescheduling problems,” European Journal of Operational Research, pp. 1121–1135, 2020.
View at: Publisher Site | Google Scholar
G. J. Lim, A. Mobasher, J. F. Bard, and A. Najjarbashi, “Nurse scheduling with lunch break assignments in operating suites,” Operations Research for Health Care, vol. 10, pp. 35–48, 2016.
View at: Publisher Site | Google Scholar
C. Di Martinelly and N. Meskens, “A bi-objective integrated approach to building surgical teams and nurse schedule rosters to maximise surgical team affinities and minimise nurses’ idle time,” International Journal of Production Economics, vol. 191, pp. 323–334, 2017.
View at: Publisher Site | Google Scholar
A. J. Chiang, A. Jeang, P. C. Chiang, P. S. Chiang, and C. P. Chung, “Multi-objective optimization for simultaneous operating room and nursing unit scheduling,” International Journal of Engineering Business Management, vol. 11, Article ID 1847979019891022, 2019.
View at: Publisher Site | Google Scholar
M. Heshmat, K. Nakata, and A. Eltawil, “Solving the patient appointment scheduling problem in outpatient chemotherapy clinics using clustering and mathematical programming,” Computers & Industrial Engineering, vol. 124, pp. 347–358, 2018.
View at: Publisher Site | Google Scholar
P. Sarkar, D. Sinha, and R. Chaki, “A framework for solution to nurse assignment problem in health care with variable demand,” in Advanced Computing and Systems for Security, pp. 3–20, Springer, Singapore, 2018.
View at: Google Scholar
A. Fügener, A. Pahr, and J. O. Brunner, “Mid-term nurse rostering considering cross-training effects,” International Journal of Production Economics, vol. 196, pp. 176–187, 2018.
View at: Publisher Site | Google Scholar
F. He, T. Chaussalet, and R. Qu, “Controlling understaffing with conditional Value-at-Risk constraint for an integrated nurse scheduling problem under patient demand uncertainty,” Operations Research Perspectives, vol. 6, Article ID 100119, 2019.
View at: Publisher Site | Google Scholar
J. Schoenfelder, K. M. Bretthauer, P. D. Wright, and E. Coe, “Nurse scheduling with quick-response methods: improving hospital performance, nurse workload, and patient experience,” European Journal of Operational Research, vol. 283, no. 1, pp. 390–403, 2020.
View at: Publisher Site | Google Scholar
M. A. Awadallah, A. L. A. Bolaji, and M. A. Al-Betar, “A hybrid artificial bee colony for a nurse rostering problem,” Applied Soft Computing, vol. 35, pp. 726–739, 2015.
View at: Publisher Site | Google Scholar
T.-H. Wu, J.-Y. Yeh, and Y.-M. Lee, “A particle swarm optimization approach with refinement procedure for nurse rostering problem,” Computers & Operations Research, vol. 54, pp. 52–63, 2015.
View at: Publisher Site | Google Scholar
M. Bagheri, A. Gholinejad Devin, and A. Izanloo, “An application of stochastic programming method for nurse scheduling problem in real word hospital,” Computers & Industrial Engineering, vol. 96, pp. 192–200, 2016.
View at: Publisher Site | Google Scholar
Z. Zheng, X. Liu, and X. Gong, “A simple randomized variable neighbourhood search for nurse rostering,” Computers & Industrial Engineering, vol. 110, pp. 165–174, 2017.
View at: Publisher Site | Google Scholar
E. Rahimian, K. Akartunalı, and J. Levine, “A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems,” European Journal of Operational Research, vol. 258, no. 2, pp. 411–423, 2017.
View at: Publisher Site | Google Scholar
M. A. Awadallah, M. A. Al-Betar, A. T. Khader, A. L. A. Bolaji, and M. Alkoffash, “Hybridization of harmony search with hill climbing for highly constrained nurse rostering problem,” Neural Computing and Applications, vol. 28, no. 3, pp. 463–482, 2017.
View at: Publisher Site | Google Scholar
F. Knust and L. Xie, “Simulated annealing approach to nurse rostering benchmark and real-world instances,” Annals of Operations Research, vol. 272, no. 1-2, pp. 187–216, 2019.
View at: Publisher Site | Google Scholar
A. M. Turhan and B. Bilgen, “A hybrid fix-and-optimize and simulated annealing approaches for nurse rostering problem,” Computers and Industrial Engineering, vol. 145, Article ID 106531, 2020.
View at: Publisher Site | Google Scholar
P. Strandmark, Y. Qu, and T. Curtois, “First-order linear programming in a column generation based heuristic approach to the nurse rostering problem,” Computers and Operations Research, vol. 120, Article ID 104945, 2020.
View at: Google Scholar
M. Asadpour, O. Boyer, and R. Tavakkoli-Moghaddam, “A blood supply chain network with backup facilities considering blood groups and expiration date: a real-world application,” International Journal of Engineering, vol. 34, 2021.
View at: Publisher Site | Google Scholar
M. Asadpour, O. Boyer, and R. Tavakkoli-Moghaddam, “Designing blood supply chain network in disaster situation considering blood groups and expiration date,” in Proceedings of the 1st International Conference on Challenges and New Solutions in Industrial Engineering and Management and Accounting, Sari, Iran, July 2020.
View at: Google Scholar
I. Bahrami, R. M. Ahari, and M. Asadpour, “A maximal covering facility location model for emergency services within M (t)/M/m/m queuing system,” Journal of Modelling in Management, 2020, ahead-of-print.
View at: Publisher Site | Google Scholar
C. Ricciardi, A. M. Ponsiglione, G. Converso, I. Santalucia, M. Triassi, and G. Improta, “Implementation and validation of a new method to model voluntary departures from emergency departments,” Authorea, 2020, Preprints.
View at: Publisher Site | Google Scholar
G. Improta, G. Guizzi, C. Ricciardi et al., “Agile six sigma in healthcare: case study at Santobono pediatric hospital,” International Journal of Environmental Research and Public Health, vol. 17, no. 3, p. 1052, 2020.
View at: Publisher Site | Google Scholar
P. Hooshangi-Tabrizi, I. Contreras, N. Bhuiyan, and G. Batist, “Improving patient-care services at an oncology clinic using a flexible and adaptive scheduling procedure,” Expert Systems with Applications, vol. 150, Article ID 113267, 2020.
View at: Publisher Site | Google Scholar
K. Rahimpour, H. Shirouyehzad, M. Asadpour, and M. Karbasian, “A PCA-DEA method for organizational performance evaluation based on intellectual capital and employee loyalty,” Journal of Modelling in Management, vol. 15, no. 4, pp. 1479–1513, 2020.
View at: Publisher Site | Google Scholar
M. Asadpour and H. Shirouyehzad, “Performance evaluation and ranking of academy award winners for best original score applying data envelopment analysis: 1990–2016,” Operations Research Letters, vol. 47, no. 5, pp. 371–376, 2019.
View at: Publisher Site | Google Scholar
I. Ajripour, M. Asadpour, and L. Tabatabaie, “A model for organization performance management applying MCDM and BSC: a case study,” Journal of Applied Research on Industrial Engineering, vol. 6, no. 1, pp. 52–70, 2019.
View at: Google Scholar
R. Jafarpisheh, M. Karbasian, and M. Asadpour, “A hybrid reliability-centered maintenance approach for mining transportation machines: a real case in Esfahan,” International Journal of Quality & Reliability Management, 2020.
View at: Publisher Site | Google Scholar
S. Mirjalili, “Genetic algorithm,” in Evolutionary Algorithms and Neural Networks, pp. 43–55, Springer, Cham, Switzerland, 2019.
View at: Google Scholar
X. S. Yang, Nature-inspired Optimization Algorithms. Chapter 5 - Genetic Algorithms, Elsevier, Amsterdam, Netherlands, 2014.

Copyright

Copyright © 2021 Atefeh Amindoust et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies

Views

3016

Downloads

1374

Citations