TY - JOUR
AU - Ĺwitalski, Piotr
AU - Bolesta, Arkadiusz
PY - 2021/12/23
Y2 - 2024/03/03
TI - Firefly algorithm applied to the job-shop scheduling problem
JF - Studia Informatica. System and information technology
JA - SI
VL - 25
IS - 1-2
SE - Article
DO - 10.34739/si.2021.25.05
UR - https://czasopisma.uph.edu.pl/studiainformatica/article/view/2776
SP - 87-100
AB - <p>The job shop scheduling problem (JSSP) is one of the most researched scheduling problems. This problem belongs to the NP-hard class. An optimal solution for this category of problems is rarely possible. We try to find suboptimal solutions using heuristics or metaheuristics. The firefly algorithm is a great example of a metaheuristic. In this paper, this algorithm is used to solve JSSP. We used some benchmarking JSSP datasets for experiments. The experimental program was implemented in the aitoa library. We investigated the optimal parameter settings of this algorithm in terms of JSSP. Analysis of the experimental results shows that the algorithm is useful to solve scheduling problems.</p>
ER -