Skip to main navigation Skip to search Skip to main content

An LLM-assisted optimization algorithm for energy-efficient flexible job shop scheduling problem with unreliable machines and AGVs

  • Zhiyuan Zeng
  • , Zhiyang Jia*
  • , Zongyang Wu
  • *Corresponding author for this work
  • Beijing Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original languageEnglish
Article number102531
JournalSwarm and Evolutionary Computation
Volume109
DOIs
Publication statusPublished - Oct 2026
Externally publishedYes

Keywords

  • Automatic guided vehicle
  • Bernoulli machine
  • Energy-saving
  • Flexible job shop scheduling problem
  • Large language model

Fingerprint

Dive into the research topics of 'An LLM-assisted optimization algorithm for energy-efficient flexible job shop scheduling problem with unreliable machines and AGVs'. Together they form a unique fingerprint.

Cite this