A Modified Mountain Gazelle Optimizer for Minimizing Energy Consumption on No-Wait Permutation Flow Shop Scheduling Problem

In the context of growing global energy demand, the industrial sector has become one of the significant contributors to the world's energy consumption.To face this challenge, scheduling has been identified as one of the potential methods to reduce energy consumption in industrial operations.This article introduces the mountain gazelle optimizer (MGO) algorithm as a solution to solve the no-wait flow shop scheduling problem with a focus on the main objective of minimizing energy consumption.The research involves comparing the performance of the MGO algorithm with popular algorithms such as grey wolf optimizer (GWO), particle swarm optimization (PSO), and genetic algorithm (GA).In addition, this research also compares the proposed MGO algorithm with the latest advanced algorithms, such as coati optimization algorithm (COA) and fire hawk optimizer (FHO).In this work, the six algorithms were tested on three different scheduling cases by repeating the process 30 times, using a population of 200 and 200 iterations to minimise energy consumption.The performance comparison between these algorithms was analyzed using the One-Way ANOVA statistical test.Based on the results, MGO outperforms GWO, PSO, GA, COA, and FHO algorithms in solving scheduling problems, with the primary function of minimizing energy consumption in Cases 1, 2, and 3.In addition, based on the convergence curve, the MGO algorithm has a better convergence curve compared to GWO, PSO, GA, COA, and FHO; it shows that the intestinal algorithm can reach the optimal solution faster and more stable during iterations than the GWO, PSO, GA, COA, and FHO algorithms.This finding confirms that the MGO algorithm has the potential to be an effective alternative in the scheduling optimization process, significantly reducing energy consumption in the industrial sector.