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

Amallynda, Ikhlasul; Hutama, Bhisma

doi:10.22219/jtiumm.vol22.no2.224-235

Cited by 3 publications

(2 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Amallynda and Hutama [ 140 ] applied the MFO algorithm to solve the flow shop problem by taking travel time between machines. To measure the effectiveness of the proposed method, it has been collated with other traditional optimization algorithms.…”

Section: Applications On Mfo Algorithmmentioning

confidence: 99%

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications

Sahoo

Saha

Ezugwu

et al. 2022

Arch Computat Methods Eng

View full text Add to dashboard Cite

The Moth flame optimization (MFO) algorithm belongs to the swarm intelligence family and is applied to solve complex real-world optimization problems in numerous domains. MFO and its variants are easy to understand and simple to operate. However, these algorithms have successfully solved optimization problems in different areas such as power and energy systems, engineering design, economic dispatch, image processing, and medical applications. A comprehensive review of MFO variants is presented in this context, including the classic version, binary types, modified versions, hybrid versions, multi-objective versions, and application part of the MFO algorithm in various sectors. Finally, the evaluation of the MFO algorithm is presented to measure its performance compared to other algorithms. The main focus of this literature is to present a survey and review the MFO and its applications. Also, the concluding remark section discusses some possible future research directions of the MFO algorithm and its variants.

show abstract

Section: Applications On Mfo Algorithmmentioning

confidence: 99%

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications

Sahoo

Saha

Ezugwu

et al. 2022

Arch Computat Methods Eng

View full text Add to dashboard Cite

show abstract

“…Each stage represents an operation on a particular machine. Research dealing with flow shop scheduling is done by [13][14][15][16][17][18][19]. Compared to FS, the JS situation happens when the jobs have various stage sequence requirements and mostly do not necessarily have the same number of stages [1].…”

Section: Introductionmentioning

confidence: 99%

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

Pakpahan,

Sumarna

2023

JTI

View full text Add to dashboard Cite

This research examined the scheduling of jobs with multiple stages unto identical parallel machines to minimize the makespan. The work is motivated by a Flexible Manufacturing System case that produces various parts and has multiple machining centers. Early research towards this system proposed a stage-by-stage independent scheduling, resulting in a non-optimal solution. This study aimed to create a better solution for the system by developing a novel heuristic algorithm based on the classical longest processing time algorithm and simultaneously considering processing time for all stages when deciding the job sequencing and job-machine allocation. The algorithm is defined as Modified LPT for Multiple Identical Machine with Multi-process Capability (M-LPT MIMMPC). We performed a numerical experiment to assess the algorithm's performance by incorporating various cases. We concluded that the resulting makespans are always better than LPT's theoretical bound for parallel machine scheduling. In some cases, it successfully gave an optimal value. Although the experiment scope was still limited, the algorithm showed promising performance results.

show abstract

A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem

Utama,

Al Imron

2024

Oper. Res. Forum

View full text Add to dashboard Cite

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

Cited by 3 publications

References 28 publications

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

A Systematic Literature Review on No-Idle Flow Shop Scheduling Problem

Contact Info

Product

Resources

About