Bhisma Hutama
Department of Industrial Engineering, Universitas Muhammadiyah Malang, Indonesia

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

Found 1 Documents
Search

The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time Ikhlasul Amallynda; Bhisma Hutama
Jurnal Teknik Industri Vol. 22 No. 2 (2021): August
Publisher : Department Industrial Engineering, University of Muhammadiyah Malang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22219/JTIUMM.Vol22.No2.224-235

Abstract

This article examined the flow shop scheduling problem by considering the travel time between machines. The objective function of this problem was to provide a makespan. The Moth Flame Optimization (MFO) algorithm was proposed to solve the flow shop problem. The MFO experiment was carried out with a combination of iteration parameters and the population of the MFO algorithm to solve the flow shop scheduling problem. The computational results showed that MFO could produce a better solution than the actual scheduling method. Furthermore, the MFO Proposal Algorithm was able to reduce the makespan by up to 3%.