Article Per Year (5 Year)
p-Index From 2020 - 2025
0.23
P-Index
This Author published in this journals
All Journal Jurnal Ilmiah Teknik Industri
Muhammad Aghniya Baihaqi
Universitas Muhammadiyah Malang
Industrial & Manufacturing Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
No-Wait Flowshop Permutation Scheduling Problem : Fire Hawk Optimizer Vs Beluga Whale Optimization Algorithm Muhammad Aghniya Baihaqi; Dana Marsetiya Utama
Jurnal Ilmiah Teknik Industri Vol. 22, No. 1, June 2023
Publisher : Department of Industrial Engineering Universitas Muhammadiyah Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23917/jiti.v22i1.21128

Abstract

No-Wait Flowshop Permutation Scheduling Problem (NWPFSP) is a scheduling problem that states that every job completed on machine n must be processed immediately on the next machine. The NWPFSP problem is an extension of the flowshop problem. This article proposes two new algorithms fire hawk optimization and beluga whale optimization, to solve the NWPFSP problem and minimize makespan. The two new algorithms developed to solve the NWPFSP problem are tested on three different cases. Each algorithm was run 30 times and was compared using an independent sample t-test. The results were also compared with the Campbell Dudek Smtih algorithm. In addition, the effectiveness of the FHO and BWO algorithms was assessed against the CDS algorithm using the Relative Error Percentage (REP) method. The results show that the FHO and BWO algorithms are better at solving NWPFSP problems when compared to the CDS algorithm. However, the BWO algorithm is more recommended in cases with large data because it can provide better results.
Co-Authors Dana Marsetya Utama