Nurse Scheduling with Opposition-Based Parallel Harmony Search Algorithm

One of the advances made in the management of human resources for the effective implementation of service delivery is the creation of personnel schedules. In this context, especially in terms of the majority of health-care systems, creating nurse schedules comes to the fore. Nurse scheduling problem (NSP) is a complex optimization problem that allows for the preparation of an appropriate schedule for nurses and, in doing so, considers the system constraints such as legal regulations, nurses' preferences, and hospital policies and requirements. There are many studies in the literature that use exact solution algorithms, heuristics, and meta-heuristics approaches. Especially in large-scale problems, for which deterministic methods may require too much time and cost to reach a solution, heuristics and meta-heuristic approaches come to the fore instead of exact methods. In the first phase of the study, harmony search algorithm (HSA), which has shown progress recently and can be adapted to many problems is applied for a dataset in the literature, and the algorithm's performance is evaluated by comparing the results with other heuristics which is applied to the same dataset. As a result of the evaluation, the performance of the classical HSA is inadequate when compared to other heuristics. In the second phase of our study, by considering new approaches proposed by the literature for HSA, the effects on the algorithm's performance of these approaches are investigated and we tried to improve the performance of the algorithm. With the results, it has been determined that the improved algorithm, which is called opposition-based parallel HSA, can be used effectively for NSPs.