arXiv AI By XinLei Zhou, Jin Huang, Jie Yang, Xinyu Li, Liang Gao

DSevolve: Enabling Real-Time Adaptive Scheduling on Dynamic Flexible Job Shop with LLM-Evolved Heuristic Portfolios

Read the original on arXiv AI →

arXiv:2603. 27628v2 Announce Type: replace Abstract: 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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 11

Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutions

arXiv:2509. 10303v2 Announce Type: replace-cross Abstract: Online reinforcement learning (RL) approaches have demonstrated strong performance on Job Shop Scheduling (JSP) and Flexible JSP (FJSP) problems by learning scheduling policies through direct interaction with simulated environments.

By Jesse van Remmerden, Zaharah Bukhsh, Yingqian Zhang
arXiv AI
6d ago

PORL: Pretrained Offline Reinforcement Learning for the Job Shop Scheduling Problem

The paper introduces PORL, a hybrid method that first trains a general scheduling policy through online reinforcement learning in simulation, then fine‑tunes it offline on production data using a KL‑divergence constraint to limit policy drift. PORL is evaluated on Job Shop Scheduling Problem instances with distribution shifts and various data sources, consistently outperforming standalone offline RL and other baselines, especially when offline data quality is low. The results suggest that offline adaptation of pretrained policies can improve industrial scheduling when direct online exploration is impractical.

By Mateo Toro Diz, Jonathan Hoss, Noah Klarmann