Flexible Job Shop Scheduling using Gravitational Search Algorithm
Flexible job shop scheduling problem (FJSP) is one of the complex and important problems in operations management.Over time, many heuristic and metaheuristic approaches have been used to find solutions of FJSP.However, the potential of the gravitational search algorithm (GSA) is still unknown while solving FJSP.Therefore, the present work uses real number encoding-based GSA (RGSA) and chaotic GSA (RCGSA) to solve FJSP.The results of 35 benchmark problems and one industrial test case show that RCGSA performs significantly better than RGSA regarding the quality of solutions and convergence in a limited number of iterations.
Authors
- Nikhil Aditya (ORCID: https://orcid.org/0000-0001-6711-5388)
- Siba Sankar Mahapatra (ORCID: https://orcid.org/0000-0002-9733-4685)
Publication Details
- Published
- 2025-01-27
- DOI
- https://doi.org/10.26573/2025.22.1.56
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00