An LLM-assisted optimization algorithm for energy-efficient flexible job shop scheduling problem with unreliable machines and AGVs
With technological advancements, the influence of small-batch flexible production models in manufacturing continues to grow, making the flexible job shop scheduling problem a key approach to addressing these industry challenges. Simultaneously, the impact of random machine failures and limited buffers cannot be underestimated, drawing academic attention to scenarios beyond fault-free production lines. Moreover, in real-world multi-process manufacturing, logistics processes are critical. Considering the simultaneous optimization of completion time and energy consumption, this paper proposes a novel energy-efficient flexible job shop scheduling problem with automatic guided vehicles (EFJSP-AGV) considering unreliable machines. To address the EFJSP-AGV, a new mixed-integer linear programming model is developed for the exact solution of small-scale instances. Furthermore, an improved memetic algorithm is proposed, which is enhanced by a heuristic designed with the assistance of large language models (LLMs). The feasibility and effectiveness of the MILP model and the improved algorithm is verified through experimental simulation.
Authors
- Zhiyang Jia (ORCID: https://orcid.org/0000-0003-3248-8875)
- Zhiyuan Zeng (ORCID: https://orcid.org/0000-0003-3004-5392)
- Zongyang Wu
Institutions
- Beijing Institute of Technology (CN)
Publication Details
- Journal
- Swarm and Evolutionary Computation
- Published
- 2026-09-18
- DOI
- https://doi.org/10.1016/j.swevo.2026.102531
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China