TY - JOUR
T1 - An LLM-assisted optimization algorithm for energy-efficient flexible job shop scheduling problem with unreliable machines and AGVs
AU - Zeng, Zhiyuan
AU - Jia, Zhiyang
AU - Wu, Zongyang
N1 - Publisher Copyright:
© 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
PY - 2026/10
Y1 - 2026/10
N2 - 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.
AB - 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.
KW - Automatic guided vehicle
KW - Bernoulli machine
KW - Energy-saving
KW - Flexible job shop scheduling problem
KW - Large language model
UR - https://www.scopus.com/pages/publications/105050762107
U2 - 10.1016/j.swevo.2026.102531
DO - 10.1016/j.swevo.2026.102531
M3 - Article
AN - SCOPUS:105050762107
SN - 2210-6502
VL - 109
JO - Swarm and Evolutionary Computation
JF - Swarm and Evolutionary Computation
M1 - 102531
ER -