×
Home Current Archive Editorial board
Instructions for papers
For Authors Aim & Scope Contact
Original scientific article

GA-PSO-MIN: A HYBRID HEURISTIC ALGORITHM FOR MULTI-OBJECTIVE JOB SCHEDULING IN CLOUD COMPUTING

By
Vahid Mokhtari Orcid logo ,
Vahid Mokhtari

Islamic Azad University , Qeshm , Iran

Nasser Mikaeilvand Orcid logo ,
Nasser Mikaeilvand
Contact Nasser Mikaeilvand

Islamic Azad University, Tehran , Tehran , Iran

Abbas Mirzaei Orcid logo ,
Abbas Mirzaei
Contact Abbas Mirzaei

Islamic Azad University Ardabil , Ardabil , Iran

Babak Nouri-moghaddam ,
Babak Nouri-moghaddam
Sajjad Jahanbakhsh Gudakahriz Orcid logo
Sajjad Jahanbakhsh Gudakahriz

Islamic Azad University Iran

Abstract

Due to the variable resource availability and diverse user needs, efficient task scheduling in cloud computing has become increasingly important. This study introduces GA-PSO-Min, a novel approach that synergistically combines genetic algorithms (GA), particle swarm optimization (PSO), and Min-Min strategy to improve scheduling efficiency in cloud environments. Unlike conventional approaches that prioritize single criteria, GA-PSO-Min emphasizes multi-objective optimization, minimizing the overall completion time while ensuring scalability and flexibility. The approach leverages the global search capabilities of GA and the fast convergence of PSO to initialize its population with a Min-Min solution, thereby outperforming standalone approaches. Compared to Min-Min, GA-PSO-Min reduces completion time by 2–7% in twelve distinct scenarios, including compute-intensive, I/O-intensive, and mixed workloads. The initial energy reduction is validated through a simple power model. It surpasses Min-Min with a temporal complexity of O(k⋅P⋅n⋅m), achieving a balance between enhanced performance and computational cost. The sensitivity analysis reveals the optimal resilience of the parameters (e.g., an inertia weight of 0.7), confirming GA-PSO-Min as an energy-efficient and scalable solution for modern cloud systems. Subsequent study will encompass improved QoS optimization and empirical validation.

References

1.
Murad S, Azmi Z, Muzahid A, Bhuiyan M, Saib M, Rahimi N, et al. SG-PBFS: Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment. Future Generation Computer Systems. 2024;150:232–42.
2.
El Bekri M. Dynamic Inertia Weight Particle Swarm Optimization for Anomaly Detection: A Case of Precision Irrigation. Journal of Internet Services and Information Security. 2023;13(2):157–76.
3.
Paulraj D, Sethukarasi T, Neelakandan S, Prakash M, Baburaj E. An Efficient Hybrid Job Scheduling Optimization (EHJSO) approach to enhance resource search using Cuckoo and Grey Wolf Job Optimization for cloud environment. PLOS ONE. 2023;18(3):e0282600.
4.
Flores-Fernandez GA, Jimenez-Carrion M, Gutierrez F, Sanchez-Ancajima RA. Genetic Algorithm and LSTM Artificial Neural Network for Investment Portfolio Optimization. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications. 2022;15(2):27–46.
5.
Zhang H, Zou Q, Ju Y, Song C, Chen D. Distance-based Support Vector Machine to Predict DNA N6- methyladenine Modification. Current Bioinformatics. 2022;17(5):473–82.

Citation

This is an open access article distributed under the  Creative Commons Attribution Non-Commercial License (CC BY-NC) License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 

Article metrics

Google scholar: See link

The statements, opinions and data contained in the journal are solely those of the individual authors and contributors and not of the publisher and the editor(s). We stay neutral with regard to jurisdictional claims in published maps and institutional affiliations.