سیویلیکا را در شبکه های اجتماعی دنبال نمایید.

Makespan Minimization using Hybrid Heuristic Metaheuristic Genetic Algorithm

Publish Year: 1402
Type: Journal paper
Language: English
View: 125

This Paper With 16 Page And PDF Format Ready To Download

این Paper در بخشهای موضوعی زیر دسته بندی شده است:

Export:

Link to this Paper:

Document National Code:

JR_IJIEPR-34-2_009

Index date: 15 August 2023

Makespan Minimization using Hybrid Heuristic Metaheuristic Genetic Algorithm abstract

This paper presents a model for minimizing the makespan in the flow shop scheduling problem. Due to the impact of increased workloads, flow shops are becoming more popular and widely used in industries. To solve the challenge of minimizing makespan, a Hybrid-Heuristic-Metaheuristic-Genetic-Algorithm (HHMGA) is proposed. The proposed HHMGA algorithm is tested using the simulation software and demonstrated with steel industry data. The results are compared with those of the best available flow shop problem algorithms such as Palmer’s slope index, Campbell-Dudek-Smith (CDS), Nawaz-Enscore-Ham (NEH), genetic algorithm (GA) and particle swarm optimization (PSO). According to empirical results and relative differences from the lower bound, the proposed technique outperforms the three heuristics and two metaheuristics algorithms in three of six cases, while the remaining three produce the same results as the NEH heuristic. In comparison to the steel industry's regular job scheduling technique, the simulation model based on HHMGA can save 4642 hours. It was discovered that the suggested model enhanced the job sequence based on the makespan requirements.

Makespan Minimization using Hybrid Heuristic Metaheuristic Genetic Algorithm Keywords:

Makespan Minimization using Hybrid Heuristic Metaheuristic Genetic Algorithm authors

PRASAD BARI

Fr. C. Rodrigues Institute of Technology

PRASAD KARANDE

Veermata Jijabai Technological Institute