Authors

Igiri C. G

Rivers State University, Nkpolu, Oroworukwu, Rivers State, Nigeria

Victor Peters

Rivers State University, Nkpolu, Oroworukwu, Rivers State, Nigeria

Igu Ajumoke Elizabeth

Rivers State University, Nkpolu, Oroworukwu, Rivers State, Nigeria

Abstract

Task scheduling in multi-core systems is a critical NP-hard optimization problem that significantly impacts system performance and resource utilization. This paper proposes a novel hybrid approach combining Bee Colony Optimization (BCO) and Genetic Algorithm (GA) for efficient task scheduling in multi-core processor systems. The hybrid BCO-GA algorithm leverages the global exploration capabilities of BCO and the exploitation strengths of GA to achieve optimal task-to-core assignments while minimizing makespan and balancing system load. The proposed approach incorporates adaptive parameter tuning, elite preservation strategies, and dynamic population management to enhance convergence speed and solution quality. Experimental evaluation using standard benchmark task graphs demonstrates that the hybrid BCO-GA algorithm achieves an average makespan reduction of 18.7% compared to standalone BCO, 15.3% compared to pure GA, and 23.4% compared to the Heterogeneous Earliest Finish Time (HEFT) algorithm. The results also show improved load balancing with a 21.5% reduction in load imbalance factor and 16.8% enhancement in processor utilization. The proposed hybrid approach demonstrates superior performance in handling various task graph characteristics including different Communication-to-Computation Ratios (CCR), task counts, and dependency structures, making it a robust solution for multi-core task scheduling problems.

Keywords

Bee Colony Optimization Genetic Algorithm Task Scheduling Multi-core Systems Hybrid Algorithm Makespan Optimization Load Balancing

Citation of this Article

Igiri C. G, Victor Peters, & Igu Ajumoke Elizabeth. (2026). A Hybrid of Bee Colony Optimization and Genetic Algorithm for Task Allocation in Multi-Core Systems to Minimize Makespan. Journal of Artificial Intelligence and Emerging Technologies (JAIET). 3(5), 1-16. Article DOI: https://doi.org/10.47001/JAIET/2026.305001

Licence Copyright (c) 2026 Journal of Artificial Intelligence and Emerging Technologies. This work is licensed under a Creative Commons Attribution Non Commercial 4.0 International Licence.

References

  1. Alhussein, N., Rahman, M. M., Bourouis, S., & Alroobaea, R. (2024). Optimizing multi-objective task scheduling in fog computing for big data application using hybrid GA-PSO algorithm. Frontiers in Big Data, 7, 1358486. https://doi.org/10.3389/fdata.2024.1358486
  2. Al-Qerem, A., Alauthman, M., Almomani, A., & Gupta, B. B. (2025). Optimizing multiprocessor performance in real-time systems using an innovative genetic algorithm approach. Scientific Reports, 15(1), 2563. https://doi.org/10.1038/s41598-024-80910-4
  3. Alshareef, M. M., Alturki, R., Alqahtani, S. A., Hamza, R., Irshad, K., & Islam, M. A. (2025). An optimized scheduling algorithm for prioritized tasks with shared resources in cloud edge computing. Expert Systems with Applications, 265, 125714. https://doi.org/10.1016/j.eswa.2025.125714
  4. Alzaqebah, M., & Abdullah, S. (2015). Hybrid bee colony optimization for examination timetabling problems. Computers & Operations Research, 54, 142–154. https://doi.org/10.1016/j.cor.2014.09.005
  5. Behera, I., & Sobhanayak, S. (2024). Task scheduling optimization in heterogeneous cloud computing environments: A hybrid GA-GWO approach. Journal of Parallel and Distributed Computing, 183, 104760. https://doi.org/10.1016/j.jpdc.2023.104766
  6. Hamed, A. Y., Alkinani, M. H., & Abdellatif, M. (2022). Optimization task scheduling bee colony algorithm for heterogeneous cloud computing systems. Applied Mathematics & Information Sciences, 16(6), 897-908. https://doi.org/10.18576/amis/160602
  7. Hegde, S. N., Babu, S. M., Iyer, N. C., & K. R., J. (2024). Multi-objective and multi constrained task scheduling framework for computational grids. Scientific Reports, 14(1), 6521. https://doi.org/10.1038/s41598-024-56957-8
  8. Karishma, & Kumar, H. (2024). A novel hybrid model for task scheduling based on particle swarm optimization and genetic algorithms. Mathematics in Engineering, 6(4), 559-606. https://doi.org/10.3934/mine.2024023
  9. Kruekaew, B., & Kimpan, W. (2020). Enhancing of artificial bee colony algorithm for virtual machine scheduling and load balancing problem in cloud computing. International Journal of Computational Intelligence Systems, 13(1), 496-510. https://doi.org/10.2991/ijcis.d.200421.001
  10. Kwok, Y.-K., & Ahmad, I. (1999). Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys, 31(4), 406–471. https://doi.org/10.1145/344588.344618
  11. Liu, J., Liu, Y., & Ding, Y. (2024). Research and optimization of task scheduling algorithm based on heterogeneous multi-core processor. Cluster Computing, 27(10), 13435-13453. https://doi.org/10.1007/s10586-024-04606-0
  12. Manasrah, A. M., & Ba Ali, H. (2018). Workflow scheduling using hybrid GA-PSO algorithm in cloud computing. Wireless Communications and Mobile Computing, 2018, Article 1934784. https://doi.org/10.1155/2018/1934784
  13. Niu, J., Song, S., Zhou, Z., Yang, Q., & Zhu, F. (2024). A hybrid PSO and GA algorithm with rescheduling for task offloading in device-edge-cloud collaborative computing. Cluster Computing, 28(2), 1-19. https://doi.org/10.1007/s10586-024-04851-3
  14. Sabry, S. S., & Saleh, A. I. (2022). Multi-objective hybrid genetic algorithm for task scheduling problem in cloud computing. Neural Computing and Applications, 34(11), 9029-9049. https://doi.org/10.1007/s00521-021-06002-w
  15. Teodorović, D. (2009). Bee colony optimization (BCO). In C. L. Mumford & L. C. Jain (Eds.), Computational intelligence: Collaboration, fusion and emergence (pp. 39–60). Springer. (Foundational BCO description with phases adaptable to hybrids.)
  16. Topcuoglu, H., Hariri, S., & Wu, M.-Y. (2002). Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems, 13(3), 260–274. https://doi.org/10.1109/71.993206