EUVIMEDEUVIMED entdecken
Crossref

LLM-Assisted Automatic Memetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots

Rui Li, Ling Wang, Hongyan Sang, Lizhong Yao, Lijun Pan

IEEE Transactions on Evolutionary Computation · 2026-08 · 30 (4) · 1377-1389

DOI: 10.1109/tevc.2025.3556186 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Evolutionary Computation, 2026-08. Verfasst von Rui Li und 4 weiteren Autor:innen. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: National Key Research and Development Project, National Natural Science Foundation of China, National Natural Science Foundation of China Regional United Development Fund.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study addresses the lot-streaming hybrid job shop scheduling problem with variable sublots (LHJSV), inspired by a real-world aircraft tooling shop. A computational model is developed to represent the complex scheduling processes of the tooling shop. To solve this problem, we propose an automatic memetic algorithm enhanced by a heuristic designed with the assistance of a large language model (LLM). The approach is designed as follows: first, a memetic computing framework with automated algorithmic design is proposed for LHJSV. Second, a cooperative evolutionary heuristic framework based on problem decomposition is introduced, enabling the LLM to comprehend the LHJSV characteristics and generate feasible algorithms. Third, problem-specific prompts for LHJSV are carefully designed to guide the LLM. To evaluate the effectiveness of the proposed method, 20 benchmark instances derived from the Taillard dataset and a real-world case involving 575 operations are utilized. The proposed algorithm is compared against three swarm-based algorithms, an end-to-end method, and an LLM-based algorithm. Experimental results demonstrate that our method outperforms the compared algorithms on 85% of benchmark instances and exhibits significant superiority in real-world scenarios.

Förderung

  • National Key Research and Development Project
  • National Natural Science Foundation of China
  • National Natural Science Foundation of China Regional United Development Fund

Zitieren

APA

Li, R., Wang, L., Sang, H., Yao, L., & Pan, L. (2026). LLM-Assisted Automatic Memetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots. IEEE Transactions on Evolutionary Computation, 30(4), 1377-1389. https://doi.org/10.1109/tevc.2025.3556186

Vancouver

Li R, Wang L, Sang H, Yao L, Pan L. LLM-Assisted Automatic Memetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots. IEEE Transactions on Evolutionary Computation. 2026;30(4):1377-1389. doi:10.1109/tevc.2025.3556186

BibTeX
@article{Li2026,
  author = {Li, Rui and Wang, Ling and Sang, Hongyan and Yao, Lizhong and Pan, Lijun},
  title = {LLM-Assisted Automatic Memetic Algorithm for Lot-Streaming Hybrid Job Shop Scheduling With Variable Sublots},
  journal = {IEEE Transactions on Evolutionary Computation},
  year = {2026},
  volume = {30},
  number = {4},
  pages = {1377--1389},
  doi = {10.1109/tevc.2025.3556186}
}
Kostenlos starten →