The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time

Jurnal Teknik Industri

Bhisma Hutama¹  Ikhlasul Amallynda¹ 

[1] Department of Industrial Engineering, Universitas Muhammadiyah Malang, Indonesia;

关键词: makespan;    transportation time;    flow shop;    moth flame optimization algorithm;   

DOI  :  10.22219/JTIUMM.Vol22.No2.224-235

来源: DOAJ

【 摘 要 】

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%.

【 授权许可】

Unknown