In dynamic flexible job shops, order arrivals, machine breakdowns, and processing-time deviations continually reshape the scheduling state and the priority trade-offs behind dispatching decisions. Dispatching rules are well suited to this setting because they are fast, interpretable, and easy to deploy, and recent LLM-assisted automatic heuristic design further expands their expressiveness by evolving composite priority functions. The key challenge is to make these evolved rule behaviors state-adaptive without losing the rapid response needed for online rescheduling. This paper proposes a dynamic self-evolutionary framework DSevolve, which separates offline rule-library construction from online state-conditioned rule selection. Offline, an LLM-guided quality-diversity search combines multi-persona seeding, a MAP-Elites behavioral archive, and behavior-guided variation to evolve a library of complementary rules rather than a single elite, and event-level simulation then trains a neural selector to rank the rules by state. Online, after each rescheduling event, a neural selector maps a 22-dimensional state fingerprint to rule scores and dispatches the top-ranked rule within about a second, meeting the response-time requirement after each disruption. Experiments on dynamic instances derived from standard flexible job shop benchmarks show that DSevolve achieves lower mean makespan than individual LLM-evolved rules, classical dispatching rules, and learning-based baselines under a one-active-rule deployment protocol. Trained only on small instances, the selector transfers zero-shot to substantially larger dynamic shops. These results show that state-conditioned selection preserves the speed and interpretability of dispatching rules while improving adaptability.
Investigation of the Generalisation Ability of Genetic Programming-evolved Scheduling Rules in Dynamic Flexible Job Shop Scheduling
Centre for Data Science;Artificial Intelligence \& School of Engineering;Computer Science, Victoria University of Wellington, Wellington 6140, New Zealand
DyRo-MCTS: A Robust Monte Carlo Tree Search Approach to Dynamic Job Shop Scheduling
Centre for Data Science & Artificial Intelligence(数据科学与人工智能中心);School of Engineering & Computer Science(工程与计算机科学学院);Victoria University of Wellington(惠灵顿维多利亚大学)
Policy-Based Reinforcement Learning with Action Masking for Dynamic Job Shop Scheduling under Uncertainty: Handling Random Arrivals and Machine Failures
South Westphalia University of Applied Sciences(西南弗劳恩霍夫应用科学大学)
Models and Strategies for Variants of the Job Shop Scheduling Problem
Cork Constraint Computation Centre(科克约束计算中心);University College Cork(科克大学学院);CNRS(法国国家科学研究中心);LAAS(法国航空航天实验室);Université de Toulouse(图卢兹大学);UPS(图卢兹第三大学);INSA(法国国立应用科学学院);INP(法国国立理工学院);ISAE(法国高等航空航天学院);UT1(图卢兹第一大学);UTM(图卢兹第二大学)
Deep Reinforcement Learning for Flexible Job Shop Scheduling with Random Job Arrivals
Centre for Artificial Intelligence, Zurich University of Applied Sciences(人工智能中心,苏黎世应用科学大学);Inspire AG(Inspire公司);Automatic Control Laboratory, ETH Zurich(自动控制实验室,苏黎世联邦理工学院)
RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified States
School of Computing and Information Systems, Singapore Management University, Singapore(新加坡管理大学计算机与信息系);College of Computing and Data Science, Nanyang Technological University, Singapore(南洋理工大学计算与数据科学学院);Institute of Marine Science and Technology, Shandong University, China(山东大学海洋科学与技术研究院)
Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning
Nanyang Technological University(南洋理工大学);Institute of Marine Science and Technology, Shandong University(山东大学海洋科学与技术研究院);National University of Singapore(新加坡国立大学);Singapore Institute of Manufacturing Technology, A*STAR(新加坡科技研究局制造技术研究院)
Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling
Nanyang Technological University(南洋理工大学);Singapore Management University(新加坡管理大学);Institute of Marine Science and Technology, Shandong University(山东大学海洋科学与技术研究院);Eindhoven University of Technology(埃因霍温理工大学)
ReflecSched: Solving Dynamic Flexible Job-Shop Scheduling via LLM-Powered Hierarchical Reflection
School of Computer Science and Engineering(计算机科学与工程学院);Beihang University(北京航空航天大学);Qingdao Research Institute(青岛研究院);Hangzhou Innovation Institute(杭州创新研究院);Zhongguancun Laboratory(中关村实验室)
Graph Neural Networks for Job Shop Scheduling Problems: A Survey
Eindhoven University of Technology(埃因霍温理工大学);Eindhoven Artificial Intelligence Systems Institute(埃因霍温人工智能系统研究所);Nanyang Technological University(南洋理工大学);Nanjing University of Aeronautics and Astronautics(南京航空航天大学);College of Computing and Data Science(计算与数据科学学院);College of Economics and Management(经济与管理学院);Department of Industrial Engineering & Innovation Sciences(工业工程与创新科学系)
Hybrid intelligence for dynamic job-shop scheduling with deep reinforcement learning and attention mechanism
Shenzhen International Graduate School, Tsinghua University(清华大学深圳国际研究生院);School of Intelligent Systems Science and Engineering, Jinan University(暨南大学智能系统科学与工程学院)
Low-Cost Labels, Reliable Choices: Rollout-Calibrated Hyper-Heuristics for Job Shop Scheduling
Faculty of Applied Sciences, Macao Polytechnic University(澳门理工学院应用科学学院);Pazhou Lab (Huangpu), Guangzhou(广州 Pazhou 实验室(黄埔));College of Animal Science and Technology, Zhongkai University of Agriculture and Engineering(仲恺农业工程学院动物科学与技术学院);Macao Polytechnic University(澳门理工学院)