Have a personal or library account? Click to login
Methods and Algorithms for Flexible Job Shop Scheduling − A State of the Art Cover

Methods and Algorithms for Flexible Job Shop Scheduling − A State of the Art

Open Access
|Jun 2025

Abstract

The Job Shop Scheduling Problem (JSSP) attracts many researchers due to its combinatorial nature and its discovery in numerous practical applications. This type of problem is characterized by high computational complexity; therefore, solving large-sized problems is not accessible with exact optimization methods. Very often, real JSSP problems can be presented as Flexible Job Shop Scheduling Problems (FJSSP). For these problems, there are single-criterion and multi-criteria mathematical models. On the other hand, the ways to solve this type of problems include exact methods and heuristic or metaheuristic algorithms. This paper the aim to review the progress of research in the field of solving FJSSP over the last 10 years, as well as to show current trends for future scientific developments in this area.

DOI: https://doi.org/10.2478/cait-2025-0009 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 3 - 30
Submitted on: Jan 28, 2025
Accepted on: Mar 7, 2025
Published on: Jun 25, 2025
Published by: Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2025 Vassil Guliashki, Leoneed Kirilov, Galia Marinova, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.