Nurse scheduling with opposition-based parallel harmony search algorithm

Basit Öğe Kaydı
dc.contributor.authorCetin Yagmur, Ece.
dc.contributor.authorSarucan, Ahmet.
dc.date.accessioned2020-03-26T20:15:33Z
dc.date.available2020-03-26T20:15:33Z
dc.date.issued2019
dc.departmentSelçuk Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.description.abstractOne 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.en_US
dc.identifier.citationYagmur, E. C., Sarucan, A. (2019). Nurse Scheduling with Opposition-Based Parallel Harmony Search Algorithm. Journal of Intelligent Systems, 28(4), 633-647.
dc.identifier.doi10.1515/jisys-2017-0150en_US
dc.identifier.endpage647en_US
dc.identifier.issn0334-1860en_US
dc.identifier.issn2191-026Xen_US
dc.identifier.issue4en_US
dc.identifier.pmid#YOKen_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.startpage633en_US
dc.identifier.urihttps://dx.doi.org/10.1515/jisys-2017-0150
dc.identifier.urihttps://hdl.handle.net/20.500.12395/38049
dc.identifier.volume28en_US
dc.identifier.wosWOS:000486914700010en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorCetin Yagmur, Ece.
dc.institutionauthorSarucan, Ahmet.
dc.language.isoenen_US
dc.publisherWALTER DE GRUYTER GMBHen_US
dc.relation.ispartofJOURNAL OF INTELLIGENT SYSTEMSen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectHarmony search algorithmen_US
dc.subjectnurse scheduling problemen_US
dc.subjectmeta-heuristicsen_US
dc.subjectparallel groupingen_US
dc.subjectopposition-based learningen_US
dc.titleNurse scheduling with opposition-based parallel harmony search algorithmen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Ece Cetin YAGMUR.pdf
Boyut:
659.03 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Full Text Access
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü/Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu