Proceedings of International Conference on Applied Innovation in IT
2025/06/27, Volume 13, Issue 2, pp.305-311

Minimizing Makespan in Open-Shop Operating Room Scheduling Using Variants of Bat Algorithm


Tabark Nameer Abd Ali and Luma S. Hasan


Abstract: Operational healthcare management faces growing pressure to develop efficient operating room scheduling systems because these systems require optimal resource management, minimum patient waiting times, and reduced operational expenses. Scheduling problems have traditionally been solved using mixed integer programming (MIP), but these methods have become computationally inefficient when dealing with large complex scheduling scenarios. Exact scheduling methods lose their practical value in hospital operating room planning as the problem complexity rapidly increases according to the number of available operating rooms and scheduled surgeries. The necessity for adaptable intelligent scheduling methods emerges because organisations require methods that maintain excellent solution quality along with swift execution and cost-effective resources. The Bat Algorithm (BA) techniques within swarm intelligence demonstrate successful potential to solve challenging combinatorial issues through natural optimisation methods. This paper uses five Bat Algorithm optimisations to resolve operating room scheduling by reducing makespans. The algorithms examined are the Modified Bat Algorithm (MBA), Chaotic Bat Algorithm (CBA), Discrete Bat Algorithm (DBA), Multi-Objective Bat Algorithm (MOBA), and Binary Bat Algorithm (BBA). For this analysis, two distributions are the Pearson and Fisher distributions. We perform several Operating room scheduling studies to assess the effectiveness and efficiency of these five algorithms on different distributions and compare the results. The findings indicate that all five improved the solution of Operating room scheduling, but the Chaotic Bat Algorithm (CBA) with Fisher's distribution became the best solution for the given scenario.

Keywords: Operating Room Scheduling, Makespan, Bat Algorithm, Operation Room, Surgeries.

DOI: 10.25673/120450

Download: PDF

References:

  1. J. Dick, J. M. Schumann, B. Nuseibeh, L. Athens, J. Zobel, and A. M. Qazi, Scheduling: Theory, Algorithms, and Systems, 2022.
  2. K. R. Baker and D. Trietsch, Principles of Sequencing and Scheduling, Hoboken, NJ: John Wiley & Sons, 2018.
  3. M. M. Ahmadian, M. Khatami, A. Salehipour, and T. Cheng, “Four decades of research on the open-shop scheduling problem to minimise the makespan,” European Journal of Operational Research, vol. 295, no. 2, pp. 399–426, 2021.
  4. Y. K. Lin and M. Y. Li, “Solving operating room scheduling problem using artificial bee colony algorithm,” Healthcare, vol. 9, no. 2, 2021, doi: 10.3390/healthcare9020152.
  5. X. S. Yang, “A new metaheuristic bat-inspired algorithm,” in Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), pp. 65–74, 2010.
  6. A. Rahimi, S. M. Hejazi, M. Zandieh, and M. Mirmozaffari, “A novel hybrid simulated annealing for no-wait open-shop surgical case scheduling problems,” Applied System Innovation, vol. 6, no. 1, pp. 1–21, 2023, doi: 10.3390/asi6010015.
  7. T. F. Abdelmaguid, “Bi-objective dynamic multiprocessor open shop scheduling for maintenance and healthcare diagnostics,” Expert Systems with Applications, vol. 186, May 2021, doi: 10.1016/j.eswa.2021.115777.
  8. W. Xiang, J. Yin, and G. Lim, “An ant colony optimisation approach for solving an operating room surgery scheduling problem,” Computers and Industrial Engineering, vol. 85, pp. 335–345, 2015, doi: 10.1016/j.cie.2015.04.010.
  9. H. Fei, N. Meskens, and C. Chu, “A planning and scheduling problem for an operating theatre using an open scheduling strategy,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 221–230, 2010, doi: 10.1016/j.cie.2009.02.012.
  10. M. Shehab, et al., “A comprehensive review of bat inspired algorithm: Variants, applications, and hybridization,” Archives of Computational Methods in Engineering, vol. 30, no. 2, Springer Netherlands, 2023, doi: 10.1007/s11831-022-09817-5.
  11. W. A. Almahdi, H. A. Lafta, and Y. H. Ali, “Intelligent task scheduling using bat and harmony optimization,” Iraqi Journal of Science, vol. 64, no. 8, pp. 4187–4197, 2023, doi: 10.24996/ijs.2023.64.8.38.
  12. Y. K. Lin and Y. Y. Chou, “A hybrid genetic algorithm for operating room scheduling,” Health Care Management Science, vol. 23, no. 2, pp. 249–263, 2020, doi: 10.1007/s10729-019-09481-5.
  13. J. Feng, H. Kuang, and L. Zhang, “EBBA: An enhanced binary bat algorithm integrated with chaos theory and Lévy flight for feature selection,” Future Internet, vol. 14, no. 6, pp. 1–16, 2022, doi: 10.3390/fi14060178.
  14. S. U. Umar, T. A. Rashid, A. M. Ahmed, B. A. Hassan, and M. R. Baker, “Modified bat algorithm: A newly proposed approach for solving complex and real-world problems,” Soft Computing, vol. 28, no. 13–14, pp. 7983–7998, 2024, doi: 10.1007/s00500-024-09761-5.
  15. A. H. Gandomi and X. S. Yang, “Chaotic bat algorithm,” Journal of Computational Science, vol. 5, no. 2, pp. 224–232, 2014, doi: 10.1016/j.jocs.2013.10.002.
  16. X. S. Yang, “Bat algorithm for multi-objective optimisation,” International Journal of Bio-Inspired Computation, vol. 3, no. 5, pp. 267–274, 2011, doi: 10.1504/IJBIC.2011.042259.

    HOME

       - Conference
       - Journal
       - Paper Submission to Journal
       - For Authors
       - For Reviewers
       - Important Dates
       - Conference Committee
       - Editorial Board
       - Reviewers
       - Last Proceedings


    PROCEEDINGS

       - Volume 13, Issue 2 (ICAIIT 2025)
       - Volume 13, Issue 1 (ICAIIT 2025)
       - Volume 12, Issue 2 (ICAIIT 2024)
       - Volume 12, Issue 1 (ICAIIT 2024)
       - Volume 11, Issue 2 (ICAIIT 2023)
       - Volume 11, Issue 1 (ICAIIT 2023)
       - Volume 10, Issue 1 (ICAIIT 2022)
       - Volume 9, Issue 1 (ICAIIT 2021)
       - Volume 8, Issue 1 (ICAIIT 2020)
       - Volume 7, Issue 1 (ICAIIT 2019)
       - Volume 7, Issue 2 (ICAIIT 2019)
       - Volume 6, Issue 1 (ICAIIT 2018)
       - Volume 5, Issue 1 (ICAIIT 2017)
       - Volume 4, Issue 1 (ICAIIT 2016)
       - Volume 3, Issue 1 (ICAIIT 2015)
       - Volume 2, Issue 1 (ICAIIT 2014)
       - Volume 1, Issue 1 (ICAIIT 2013)


    PAST CONFERENCES

       ICAIIT 2025
         - Photos
         - Reports

       ICAIIT 2024
         - Photos
         - Reports

       ICAIIT 2023
         - Photos
         - Reports

       ICAIIT 2021
         - Photos
         - Reports

       ICAIIT 2020
         - Photos
         - Reports

       ICAIIT 2019
         - Photos
         - Reports

       ICAIIT 2018
         - Photos
         - Reports

    ETHICS IN PUBLICATIONS

    ACCOMODATION

    CONTACT US

 

        

         Proceedings of the International Conference on Applied Innovations in IT by Anhalt University of Applied Sciences is licensed under CC BY-SA 4.0


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


           ISSN 2199-8876
           Publisher: Edition Hochschule Anhalt
           Location: Anhalt University of Applied Sciences
           Email: leiterin.hsb@hs-anhalt.de
           Phone: +49 (0) 3496 67 5611
           Address: Building 01 - Red Building, Top floor, Room 425, Bernburger Str. 55, D-06366 Köthen, Germany

        site traffic counter

Creative Commons License
Except where otherwise noted, all works and proceedings on this site is licensed under Creative Commons Attribution-ShareAlike 4.0 International License.