Please use this identifier to cite or link to this item: https://dspace.ncfu.ru/handle/123456789/32187
Title: COBGA: MCDM-assisted improved genetic algorithm for scheduling Industrial-Internet-of-Things jobs in cloud computing
Authors: Lapina, M. A.
Лапина, М. А.
Keywords: Chaotic map;Opposition-based learning;Cloud computing;Genetic algorithm;Industrial-Internet-of-Things;Multi-Criteria Decision-Making;Scheduling
Issue Date: 2025
Publisher: Springer
Citation: Qasim, M., Sajid, M., Lapina, M., Shahid, M. COBGA: MCDM-assisted improved genetic algorithm for scheduling Industrial-Internet-of-Things jobs in cloud computing // Cluster Computing. - 2025. - 28 (15). - art. no. 944. - DOI: 10.1007/s10586-025-05680-8
Series/Report no.: Cluster Computing
Abstract: Industrial-Internet-of-Things (IIoT) revolutionizes industrial operations by integrating data analytics, cloud services, and smart devices to increase productivity and efficiency. Scheduling numerous IIoT tasks in cloud computing is a complex and indispensable problem due to the dynamic nature of resources and the need for efficient matching between IIoT tasks and cloud resources. This paper proposes a Chaotic and Opposition-Based learning Genetic Algorithm (COBGA) to address complex IIoT task scheduling to optimize four objectives. The proposed COBGA extends the Genetic Algorithm (GA) using a piecewise linear chaotic map (PWLCM) and Opposition-Based learning (OBL) to boost the convergence speed and solution quality while avoiding getting trapped in local optima. The COBGA also employs an efficient fitness computation method with linear time complexity rather than quadratic for given tasks and virtual machines. The COBGA also employs the Multi-Criteria Decision-Making technique (MCDM), Multi-Objective Optimization by Ratio Analysis (MOORA), to find the best possible solution based on the trade-off of four contradictory scheduling objectives, i.e., makespan, monetary cost, energy efficiency, and security time requirements. The performance of the proposed COBGA algorithm was compared with improved GA, Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Salp Swarm Algorithm (SSA), Differential Evolution (DE), Greylag Goose Optimization (GGO), and Secretary Bird Optimization Algorithm (SBOA), through extensive experimentation and statistical analysis. The COBGA significantly offers improved results among peer algorithms as it achieves improvements of approximately 87.5%, 86.5%, 50.5%, and 37.5% for makespan, energy consumption, cost, and security time, respectively, for varying task parameters.
URI: https://dspace.ncfu.ru/handle/123456789/32187
Appears in Collections:Статьи, проиндексированные в SCOPUS, WOS

Files in This Item:
File Description SizeFormat 
scopusresults 3716.pdf
  Restricted Access
126.84 kBAdobe PDFView/Open
WoS 2216.pdf
  Restricted Access
110.72 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.