EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Flow shop scheduling optimization using firefly algorithm to minimize makespan

Nikmatus Sholikha, Juan Michael Joshua Tampubolon, Rudi Nurdiansyah

JENIUS : Jurnal Terapan Teknik Industri · 29.03.2026 · 7 (1) · 332-340

DOI: 10.37373/jenius.v7i1.1986 ↗

Kurz gefasst

Fachartikel in der Zeitschrift JENIUS : Jurnal Terapan Teknik Industri, online erschienen am 29.03.2026. Verfasst von Nikmatus Sholikha und 2 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study investigates the application of the Firefly Algorithm (FA) to solve a flowshop scheduling problem with 17 jobs and 6 machines, aiming to minimize makespan. Flow shop scheduling is a critical and computationally complex decision problem in manufacturing systems due to its direct impact on production lead time, machine utilization, and overall operational efficiency. Given the NP-hard nature of the problem, metaheuristic optimization approaches provide practical alternatives to exact methods. In this research, the Firefly Algorithm is implemented with tuned parameter settings to ensure robust and consistent solution quality across multiple independent computational experiments. The results indicate that the FA is capable of generating high-quality scheduling solutions, achieving a best makespan of 34,992.22 seconds. Moreover, the algorithm produces several alternative job sequences with identical optimal makespan values, offering flexibility for production planners when selecting feasible schedules under operational constraints. To evaluate its relative performance, the FA is benchmarked against the Genetic Algorithm (GA), a widely adopted metaheuristic in scheduling research. The comparative analysis shows that the FA outperforms the GA by achieving a 2.09% reduction in makespan. These findings demonstrate the strong search capability and stability of the Firefly Algorithm in addressing complex flow shop scheduling problems. From an industrial perspective, the proposed approach provides a practical decision-support tool for improving production efficiency, reducing manufacturing lead times, and enhancing overall system performance in competitive manufacturing environments.

Zitieren

APA

Sholikha, N., Tampubolon, J. M. J., & Nurdiansyah, R. (2026). Flow shop scheduling optimization using firefly algorithm to minimize makespan. JENIUS : Jurnal Terapan Teknik Industri, 7(1), 332-340. https://doi.org/10.37373/jenius.v7i1.1986

Vancouver

Sholikha N, Tampubolon JMJ, Nurdiansyah R. Flow shop scheduling optimization using firefly algorithm to minimize makespan. JENIUS : Jurnal Terapan Teknik Industri. 2026;7(1):332-340. doi:10.37373/jenius.v7i1.1986

BibTeX
@article{Sholikha2026,
  author = {Sholikha, Nikmatus and Tampubolon, Juan Michael Joshua and Nurdiansyah, Rudi},
  title = {Flow shop scheduling optimization using firefly algorithm to minimize makespan},
  journal = {JENIUS : Jurnal Terapan Teknik Industri},
  year = {2026},
  volume = {7},
  number = {1},
  pages = {332--340},
  doi = {10.37373/jenius.v7i1.1986}
}
Kostenlos starten →