Hospital Nurse Scheduling Optimization Using Simulated Annealing and Probabilistic Cooling Scheme

Ferdi Chahyadi(1*), Azhari SN(2), Hendra Kurniawan(3)

(1) Jurusan Teknik Informatika, Universitas Maritim Raja Ali Haji
(2) Departemen Ilmu Komputer dan Elektronika, FMIPA UGM, Yogyakarta
(3) Jurusan Teknik Informatika, Universitas Maritim Raja Ali Haji
(*) Corresponding Author


Nurse’s scheduling in hospitals becomes a complex problem, and it takes time in its making process. There are a lot of limitation and rules that have to be considered in the making process of nurse’s schedule making, so it can fulfill the need of nurse’s preference that can increase the quality of the service. The existence variety of different factors that are causing the nurse scheduling problem is so vast and different in every case.

The study is aimed to develop a system used as an equipment to arrange nurse’s schedule. The working schedule obtained will be checked based on the constraints that have been required. Value check of the constraint falsification used Simulated Annealing (SA) combined with cooling method of Probabilistic Cooling Scheme (PCS). Transitional rules used cost matrix that is employed to produce a new and more efficient state.

The obtained  results showed that PCS cooling methods combined with the transition rules of the cost matrix generating objective function value of  new solutions better and faster in processing time than the cooling method exponential and logarithmic. Work schedule generated by the application also has a better quality than the schedules created manually by the head of the room.


Nurse’s Scheduling; Simulated Annealing; Cost Matrix; PCS

Full Text:



[1] S. Toth, “Nurse Rostering,” Masaryk University, 2008.

[2] S. Kundu, M. Mahato, B. Mahanty, and S. Acharyya, “Comparative Performance of Simulated Annealing and Genetic Algorithm in Solving Nurse Scheduling Problem,” Int. Multiconference Eng. Comput. Sci., vol. I, pp. 19–21, 2008.

[3] E. B. Schlünz and J. H. van Vuuren, “An investigation Into the Effectiveness of Simulated Annealing As a Solution Approach for the Generator Maintenance Scheduling Problem,” Int. J. Electr. Power Energy Syst., vol. 53, pp. 166–174, Dec. 2013.

[4] A. I. Diveev and O. V. Bobr, “Variational Genetic Algorithm for NP-hard Scheduling Problem Solution,” Procedia Comput. Sci., vol. 103, no. October 2016, pp. 52–58, 2017.

[5] D. M. D. U. Putra and . S., “Penerapan Algoritma Genetika Untuk Menyelesaikan Permasalahan Penjadwalan Perawat Dengan Fuzzy Fitness Function,” IJCCS (Indonesian J. Comput. Cybern. Syst., vol. 6, no. 2, 2013 [Online]. Available: [Accessed: 17-Mar-2017]

[6] E. Samana, B. Prihandono, and E. Noviani, “Aplikasi Simulated Annealing Untuk Menyelesaikan Traveling Salesman Problem,” Bul. Ilm. Mat. Stat. dan Ter., vol. 3, no. 1, pp. 25–32, 2015.

[7] Suyanto, Algoritma Optimasi Deterministik atau Probabilitik. Yogyakarta: Graha Ilmu, 2010.

[8] R. K. Samuel and P. Venkumar, “Optimized Temperature Reduction Schedule for Simulated Annealing Algorithm,” Mater. Today Proc., vol. 2, no. 4–5, pp. 2576–2580, 2015.

[9] G. V. Gonzales et al., “A Comparison of Simulated Annealing Schedules for Constructal Design of Complex Cavities Intruded Into Conductive Walls With Internal Heat Generation,” Energy, vol. 93, pp. 372–382, Dec. 2015.

[10] L. Rosocha, S. Vernerova, and R. Verner, “Medical Staff Scheduling Using Simulated Annealing,” Qual. Innov. Prosper., vol. 19, no. 1, pp. 1–11, Jul. 2015.


Article Metrics

Abstract views : 4024 | views : 2794


  • There are currently no refbacks.

Copyright (c) 2018 IJCCS (Indonesian Journal of Computing and Cybernetics Systems)

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Copyright of :
IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
ISSN 1978-1520 (print); ISSN 2460-7258 (online)
is a scientific journal the results of Computing
and Cybernetics Systems
A publication of IndoCEISS.
Gedung S1 Ruang 416 FMIPA UGM, Sekip Utara, Yogyakarta 55281
Fax: +62274 555133 |

View My Stats1
View My Stats2