Open AccessThe Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time
Author(s) -
Ikhlasul Amallynda,
Bhisma Hutama
Publication year - 2021
Publication title -
jurnal teknik industri
Language(s) - English
Resource type - Journals
eISSN - 2527-4112
pISSN - 1978-1431
DOI - 10.22219/jtiumm.vol22.no2.224-235
Subject(s) - job shop scheduling , flow shop scheduling , mathematical optimization , computer science , scheduling (production processes) , population , algorithm , mathematics , schedule , medicine , environmental health , operating system
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%.