Overview
Field: AI Authors: Shijie Cao, Yuan Yuan, Jing Liu Published: 2026-05-28 arXiv: 2605.27566
Abstract
Progress in neural combinatorial optimization for the Dynamic Flexible Job Shop Scheduling Problem (DFJSP) is currently hindered by a methodological tension: static benchmarks encourage benchmark overfitting, while uncalibrated generators obscure algorithmic capability with stochastic noise. To resolve this, the authors introduce DynaSchedBench, a diagnostic framework for DFJSP that rigorously controls the instance-generation process.
Key Contributions
- Sequential Event-Space Calibrator (SESC): Instead of relying on parameter sampling, the framework computes a novel Schedule Stress Index (SSI) to stratify instances by difficulty.
- Efficiency: SESC is substantially more computationally efficient than evolutionary baselines while converging reliably to the target metrics.
- Modular design: The framework integrates components for instance generation, snapshot-based simulation, agents, evaluation, and visualization.
- Observability paradox: In step-wise online decision-making, giving agents full structural information actually *degrades* policy performance, while concise information performs better.
- Diminishing returns from tooling: Despite significant token expenditure, tool augmentation and refinement strategies do not reliably improve performance.
- Heuristic baseline dominance: Most LLM agents consistently fail to surpass strong heuristic baselines.
- arXiv: https://arxiv.org/abs/2605.27566
Findings on LLM Scheduling Agents
Using the calibrated environment, the study reveals critical limitations of LLM agents in dynamic scheduling:
Links
*Auto-collected on 2026-05-29.*