Heuristic dispatching rules (HDRs) are widely used for solving the dynamic fuzzy job shop scheduling problem (DFJSSP). However, their performance is highly sensitive to specific scenarios and often necessitates expert customization. To overcome this, automated design methods like genetic programming (GP) and gene expression programming (GEP) have been proposed. Despite their success, these methods face challenges, such as high randomness in the search process. Recently, the combination of large language models (LLMs) with evolutionary algorithms has opened new possibilities for prompt engineering and automated algorithm design. To improve the ability of LLMs in automatic HDR design, this paper introduces a novel population self-evolutionary (SeEvo) framework, which draws inspiration from the self-reflective design strategies employed by human experts. Notably, this framework employs a novel teacher-student learning mechanism, allowing the LLM (student) to generate robust HDRs. Guided by a teacher model with complete knowledge of actual processing times, the student learns to infer fuzzy uncertainties from historical deviations, enabling it to effectively anticipate and adapt to fuzzy impacts. Experimental results demonstrate that SeEvo significantly outperforms GP, GEP, deep reinforcement learning (DRL) methods, and more than ten commonly used HDRs from the literature, particularly in previously unseen and dynamic scenarios.
A History-Guided Regional Partitioning Evolutionary Optimization for Solving the Flexible Job Shop Problem with Limited Multi-load Automated Guided Vehicles
Online Operator Design in Evolutionary Optimization for Flexible Job Shop Scheduling via Large Language Models
School of Computer Science, Guangdong University of Technology(广东工业大学计算机科学学院);Department of Computer Science, City University of Hong Kong(香港城市大学计算机科学系)
Discrete Differential Evolution Particle Swarm Optimization Algorithm for Energy Saving Flexible Job Shop Scheduling Problem Considering Machine Multi States
Business School, Shandong Normal University(山东师范大学商学院);School of Mathematics, Yunnan Normal University(云南师范大学数学学院);School of Physics and Electronics, Shandong Normal University(山东师范大学物理与电子科学学院)
Learning to Optimize Permutation Flow Shop Scheduling via Graph-based Imitation Learning
The Chinese University of Hong Kong, Shenzhen (CUHK-Shenzhen)(香港中文大学(深圳));Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学);National University of Singapore(新加坡国立大学)
Evaluation of bioinspired algorithms for the solution of the job scheduling problem
Universidad Industrial de Santander(桑坦德工业大学);Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis (I3S)(索菲亚-安蒂波利斯信息、信号与系统实验室);Université Nice Sophia Antipolis(尼斯索菲亚-安蒂波利斯大学);Universidad Politécnica de Valencia(瓦伦西亚理工大学);Ministerio de Tecnologias de la Información y las Comunicaciones MINTIC(信息与通信技术部);Universidad de Puerto Rico(波多黎各大学);Universidad Nacional Abierta y a Distancia – UNAD(国立开放与远程教育大学)