Volume 34, Issue 2 (IJIEPR 2023)                   IJIEPR 2023, 34(2): 133-148 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

BARI P, KARANDE P. Makespan Minimization using Hybrid Heuristic Metaheuristic Genetic Algorithm. IJIEPR 2023; 34 (2) :133-148
URL: http://ijiepr.iust.ac.ir/article-1-1713-en.html
1- Fr. C. Rodrigues Institute of Technology , prasad.bari@fcrit.ac.in
2- Veermata Jijabai Technological Institute
Abstract:   (1267 Views)
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.
Full-Text [PDF 960 kb]   (577 Downloads)    
Type of Study: Research | Subject: Optimization Techniques
Received: 2023/02/8 | Accepted: 2023/05/9 | Published: 2023/05/27

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.