2024
DOI: 10.22266/ijies2024.0430.49
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 invo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 46 publications
0
0
0
Order By: Relevance
“…The experimental results indicate that the enhanced GWO algorithm outperforms the other algorithms in terms of convergence, coverage, and robustness in finding optimal Pareto solutions. The paper (Utama et al, 2024) introduces a novel application of the MGO algorithm for optimizing the no-wait flow shop scheduling problem with the aim of minimizing industrial energy consumption. The MGO algorithm is implemented with the Large Rank Value procedure.…”
Section: Optimization Algorithm In Ippsmentioning
confidence: 99%
“…The experimental results indicate that the enhanced GWO algorithm outperforms the other algorithms in terms of convergence, coverage, and robustness in finding optimal Pareto solutions. The paper (Utama et al, 2024) introduces a novel application of the MGO algorithm for optimizing the no-wait flow shop scheduling problem with the aim of minimizing industrial energy consumption. The MGO algorithm is implemented with the Large Rank Value procedure.…”
Section: Optimization Algorithm In Ippsmentioning
confidence: 99%