Implementation of Backtracking Algorithm in Determining Operation Schedule
DOI:
https://doi.org/10.56988/chiprof.v4i1.117Keywords:
Backtracking Algorithm, Operating Room, Optimization, Orthopedic Surgeon, Surgery SchedulingAbstract
Scheduling surgical operations in hospitals is a complex process requiring efficient allocation of limited resources such as specialist doctors, operating rooms, and time slots. This study implements the backtracking algorithm to create an optimal surgery schedule from Monday to Thursday, involving 8 specialist doctors (3 general surgeons and 5 obstetricians-gynecologists), and 1 orthopedic surgeon who is available only on Wednesdays and Thursdays. With 4 operating rooms and 5 sessions per day, the backtracking algorithm explores all possible scheduling combinations to avoid conflicts in time and location. The implementation results show that the algorithm successfully generates a conflict-free schedule while also assigning on-call doctors for emergency (cito) cases in surgery, obstetrics-gynecology, and orthopedics. Visualization in Excel tables and daily graphical layouts aids in verification and intuitive interpretation. This approach proves effective in handling complex and dynamic hospital scheduling scenarios.
Downloads
References
Adamuthe and R. S. Bichkar, “Personnel Scheduling: Comparative Study of Backtracking Approaches and Genetic Algorithms,” International Journal of Computer Applications, vol. 38, pp. 1–7, 2012.
Yadav, J. Chandel, and N. Gupta, “Personnel Scheduling: Comparative Study of Backtracking Approaches and Genetic Algorithms,” 2015.
D. Yan, “Based on the Curriculum and the Intelligent Analysis Backtracking Algorithm Research,” Mathematics in Practice and Theory, 2012.
Z. Sheng, “The Analysis and Design of Laboratory Course Scheduling System Based on Backtracking Algorithm,” 2012.
L. Pradenas, F. Vidal, L. Parada, and E. Melgarejo, “An algorithm to surgery scheduling and surgeons assignment in a public hospital,” 2012.
I. Sellami, M.-J. Huguet, and P. Lopez, “A backtracking algorithm for solving mixed task scheduling and resource allocation problems,” ETFA 2001. 8th Int. Conf. Emerging Technologies and Factory Automation, vol. 2, pp. 741–744, 2001.
M. Boddy and R. Goldman, “Empirical results on scheduling and dynamic backtracking,” 1994.
S. Abraham, W. Meleis, and I. D. Baev, “Efficient backtracking instruction schedulers,” Proc. 2000 Int. Conf. Parallel Architectures and Compilation Techniques, pp. 301–308, 2000.
X. Zhang, Z. Xie, Y. Xin, and J. Yang, “Time‐selective integrated scheduling algorithm with backtracking adaptation strategy,” Expert Systems, vol. 36, 2018.
X. Xiao-hao, “Application of Syncretic Backtracking Algorithm in Departure Flight Scheduling Problem,” Computer Simulation, 2012
H. Wu and P. van Beek, “Portfolios with Deadlines for Backtracking Search,” Int. J. Artif. Intell. Tools, vol. 17, pp. 835–856, 2008.
N. Sadeh, K. Sycara, and Y. Xiong, “Backtracking Techniques for Hard Scheduling Problems,” 1993.
M. Z. Abidin, W. Wiranto, and H. Setiadi, “Course Scheduling Using Dynamic-Order Backjumping (Case Study: STIKA Madiun),” ITSMART, vol. 7, pp. 101–107, 2019
K. Dasgupta and P. Roy, “Short Term Hydro-Thermal Scheduling Using Backtracking Search Algorithm,” Int. J. Appl. Metaheuristic Comput., vol. 11, pp. 38–63, 2020.
T. Li and Y. Li, “Constructive Backtracking Heuristic for Hybrid Flowshop Scheduling with Limited Waiting Times,” 2007 Int. Conf. Wireless Communications, Networking and Mobile Computing, pp. 6671–6674, 2007
Hafizena, MF, & Sutabri, T. (2025). Implementasi Algoritma Backtracking untuk Manajemen Bandwidth pada Jaringan SMA Negeri 1 Belitang. Jurnal Ilmiah dan Profesional Internasional , 4 (2), 541-547.
Billan, AC, & Sutabri, T. (2025). Restorasi penjadwalan sumur minyak yang mengalami off-time menggunakan algoritma backtracking dalam upaya optimasi produksi. Buletin Penelitian Ilmu Komputer , 5 (3), 228-234.
Amelia, R., & Sutabri, T. (2024). ANALISIS STRATEGI MENINGKATKAN VIRALITAS KONTEN PADA SHOPEE LIVE MENGGUNAKAN NATURAL LANGUAGE PROCESSING (NLP). BETRIK, 15(03), 417-431.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Sri Warianti, Tata Sutabri
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
