Please use this identifier to cite or link to this item:
http://hdl.handle.net/2080/4998Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Aditya, Nikhil | - |
| dc.contributor.author | Mahapatra, Siba Sankar | - |
| dc.date.accessioned | 2025-01-23T10:45:29Z | - |
| dc.date.available | 2025-01-23T10:45:29Z | - |
| dc.date.issued | 2025-01 | - |
| dc.identifier.citation | 22nd AIMS International Conference on Management (AIMS), IIM Kozhikode, India, 2-4 January 2025 | en_US |
| dc.identifier.uri | http://hdl.handle.net/2080/4998 | - |
| dc.description | Copyright belongs to the proceeding publisher. | en_US |
| dc.description.abstract | 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. | en_US |
| dc.subject | GSA | en_US |
| dc.subject | Metaheuristic | en_US |
| dc.subject | job shop scheduling | en_US |
| dc.subject | Real encoding | en_US |
| dc.subject | Chaotic GSA | en_US |
| dc.title | Flexible Job Shop Scheduling using Gravitational Search Algorithm | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Conference Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2024_AIMS-ICM_NAditya_Flexible.pdf | 1.08 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.