Firefly algorithm applied to the job-shop scheduling problem


  • Piotr Świtalski
  • Arkadiusz Bolesta



scheduling, job shop, firefly algorithm, aitoa library


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.


Download data is not yet available.




How to Cite

Świtalski, P., & Bolesta, A. (2021). Firefly algorithm applied to the job-shop scheduling problem. Studia Informatica. System and Information Technology, 25(1-2), 87–100.