Low-carbon no-idle permutation flow shop schedulling problem: giant trevally optimizer vs African vultures optimization algorithm

Dana Marsetiya Utama, Cantika Febrita


Greenhouse gas emissions continue to increase due to increased energy consumption. One of the largest emission-contributing sectors is the manufacturing industry. Therefore, the manufacturing industry is required to minimize carbon emissions. One of the efforts to solve the emission problem is to minimize machine downtime throughout the production procedure, which stands for no-idle permutation flowshop scheduling (NIPFSP). This article uses two metaheuristic algorithms, giant trevally optimizer (GTO) and African vultures optimization algorithm (AVOA), to solve the carbon emission problem. Both algorithms are tested on 3 cases with 30 runs for every population and iteration. To compare the outcomes of each algorithm, an independent sample t-test was employed. The results show that the GTO algorithm has better results than the AVOA algorithm on small and large case data. The findings indicate that both the GTO and AVOA algorithms yield comparable results when applied to medium-sized research datasets, suggesting their effectiveness in such scenarios.

Full Text:


DOI: http://doi.org/10.11591/ijaas.v12.i3.pp195-204


  • There are currently no refbacks.

International Journal of Advances in Applied Sciences (IJAAS)
p-ISSN 2252-8814, e-ISSN 2722-2594
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Web Analytics View IJAAS Stats