Skip to content
Conference

HHBA-GA: Hybrid Hitchcock Bird Algorithm and Genetic Algorithm Based Dynamic Task Scheduling in Edge-Cloud Computing

2025 · Proceedings of the 1st International Conference on Interdisciplinary Research in Science, Engineering, and Technology · pp. 63-71 · 0 citations · 10 references

TL;DR

Experiments indicate that HHBA-GA achieves the best performance in makespan, energy consumption, and cost efficiency compared with GA, PSO, and standalone HHBA, and the model significantly enhances resource usage, proving its effectiveness in large-scale edge-cloud applications.

Abstract

: Edge computing, a geographically distributed set of computing platforms, is crucial in modern IoT applications for faster processing and application execution. Effective task scheduling in edge-cloud computing enhances resource utilization, lowers makespan, reduces energy consumption, and achieves cost-effectiveness, meeting new time measure requirements for the modern world. This paper presents a new Hybrid Hitchcock Bird Algorithm (HHBA) and Genetic Algorithm (GA)-based dynamic task scheduling method that combines the advantages of HHBA and GA algorithms. While GA operates on the solution space to evolve a more effective solution through selection and mutation operations, refining the task allocation by promoting the use of two-point crossover and uniform crossover for the topic planning in trades, HHBA can be considered as the optimizer, honing in on the set of sub-tasks through local comparisons while ensuring an equal workload among the resources. Experiments indicate that HHBA-GA achieves the best performance in makespan, energy consumption, and cost efficiency compared with GA, PSO, and standalone HHBA. The proposed pathway leads to an increase in energy savings of up to 24% and a reduction in cost reduction of about 22% when compared to traditional approaches. Furthermore, the model significantly enhances resource usage, proving its effectiveness in large-scale edge-cloud applications.

View source

Similar papers

Open access Jul 2026

An Efficient Task Scheduling Approach in Cloud Computing Using Hybrid Fruit Fly and Ant Colony Optimization Techniques

A hybrid nature-inspired algorithm called fruit fly optimization–ant colony optimization (FOA-ACO), which combines the exploitative ant colony optimization (ACO) and the exploratory fruit fly optimization algorithm (FOA) is suggested, which enhances overall cloud performance.

Narayana Rao Appini, K. Premnadh, Karnam Sreenu et al. · 0 citations
Open access 2026

A Hybrid of Bee Colony Optimization and Genetic Algorithm for Task Allocation in Multi-Core Systems to Minimize Makespan

A novel hybrid approach combining Bee Colony Optimization and Genetic Algorithm for efficient task scheduling in multi-core processor systems that 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 is proposed.

C. Igiri, Victor Peters, Igu Ajumoke Elizabeth · 0 citations
Jul 2026

Energy-Efficient Hybrid Metaheuristic Resource Allocation Model for Dynamic Virtual Machine Scheduling in Cloud Computing Platforms

The findings suggest that HORAM is far better at using resources; fewer tasks are completed, and the total power consumed is lower than with traditional scheduling algorithms, suggesting the suggested architecture is a viable solution to sustainable cloud infrastructure management.

S. Balakrishnan, K. Aravind, T. Veeramani et al. · 0 citations
Conference Open access 2026

Job Shop Scheduling Problem Based on an Improved Genetic Algorithm

The Job Shop Scheduling Problem (JSP) is a core decision-making issue for improving production efficiency in discrete manufacturing industries. Traditional genetic algorithms (GAs) used to solve JSP suffer from bottlenecks such as a high number of invalid solutions and difficulty in balancing solution accuracy and convergence speed. To address large-scale JSP under dynamic machine fault disturbances, this study proposes an improved genetic algorithm integrating hybrid encoding and customized operators. Specifically, a hybrid encoding strategy combining job sequences and machine sequences is adopted to naturally satisfy the process and equipment constraints of JSP. The evolutionary process is optimized using tournament selection, Position-based Order Crossover (POX), and mutation within the valid domain, while a fault identification and machine switching mechanism is integrated to adapt to dynamic disturbance scenarios. Experimental results show that the improved algorithm achieves an optimal Makespan value of 190 in dynamic disturbance scenarios and exhibits strong robustness, providing an efficient and feasible solution for job shop scheduling in complex production environments.

Jianguo Du, Chengkun Li, Zijie Tang · 0 citations
Open access Jul 2026

Comparative Performance and Computational Complexity Analysis of Hybrid WGO–DRL and Heuristic, Metaheuristic and Bio-Inspired Scheduling Algorithms in Cloud Computing

A hybrid scheduling framework that integrates Hybrid Wild Goose Optimization (HWGO) with Deep Reinforcement Learning (DRL) is investigated, indicating that intelligent hybrid optimization techniques can provide adaptive and efficient task scheduling solutions for modern cloud computing environments.

Annaiah H, A. Rajesh · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.