@inproceedings{654cb72151644958ae1cae851183f107,
title = "Stochastic fractal search algorithm in permutation flowshop scheduling problem",
abstract = "In this paper, permutation flowshop scheduling problem is solved using stochastic fractal search algorithm to find a sequence of jobs minimizing makespan. SFS algorithm is inspired by the phenomenon of successful growth which uses a mathematical concept called fractal. The performance of SFS algorithm to solve permutation flowshop scheduling problem was tested using standard benchmark problems of Taillard and compared with other optimization algorithms. The results have shown that the proposed SFS algorithm performs better than other algorithms on given benchmark problems for finding the best solution found so far in minimizing makespan. Moreover, comparing with the best-known result, SFS successfully provides solutions which are near-optimal solutions.",
author = "Ayomi Sasmito and Pratiwi, {Asri Bekti}",
note = "Publisher Copyright: {\textcopyright} 2021 American Institute of Physics Inc.. All rights reserved.; International Conference on Mathematics, Computational Sciences and Statistics 2020, ICoMCoS 2020 ; Conference date: 29-09-2020",
year = "2021",
month = feb,
day = "26",
doi = "10.1063/5.0042196",
language = "English",
series = "AIP Conference Proceedings",
publisher = "American Institute of Physics Inc.",
editor = "Cicik Alfiniyah and Fatmawati and Windarto",
booktitle = "International Conference on Mathematics, Computational Sciences and Statistics 2020",
}