mlsanityData to 14 Oct 2026

DScheLLM: Enabling Dynamic Scheduling through a Fine-Tuned Dual-System Large language Model

arXiv 2601.09100 ↗First posted 14 Jan 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Production scheduling is highly susceptible to dynamic disruptions, such as variations in processing times, machine availability, and unexpected task insertions. Conventional approaches typically rely on event-specific models and explicit analytical formulations, which limits their adaptability and generalization across previously unseen disturbances. To overcome these limitations, this paper proposes DScheLLM, a dynamic scheduling approach that leverages fine-tuned large language models within a dual-system (fast-slow) reasoning architecture to address disturbances of different scales. A unified large language model-based framework is constructed to handle dynamic events, where training datasets for both fast and slow reasoning modes are generated using exact schedules obtained from an operations research solver. The Huawei OpenPangu Embedded-7B model is subsequently fine-tuned under the hybrid reasoning paradigms using LoRA. Experimental evaluations on standard job shop scheduling benchmarks demonstrate that the fast-thinking mode can efficiently generate high-quality schedules and the slow-thinking mode can produce solver-compatible and well-formatted decision inputs. To the best of our knowledge, this work represents one of the earliest studies applying large language models to job shop scheduling in dynamic environments, highlighting their considerable potential for intelligent and adaptive scheduling optimization.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 23 references that are in the map. First posted on arXiv 14 Jan 2026.

Builds on

3 of 23 references.

References · 3

  1. 2025Pangu Embedded: An Efficient Dual-system LLM Reasoner with Metacognitioncited by 62
  2. 2024Large Language Models for Manufacturingcited by 24
  3. 2025Starjob: Dataset for LLM-Driven Job Shop Schedulingcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025ReflecSched: Solving Dynamic Flexible Job-Shop Scheduling via LLM-Powered Hierarchical Reflection
  2. 2025Evaluating the Efficacy of LLM-Based Reasoning for Multiobjective HPC Job Scheduling
  3. 2025Evaluating Large Language Models for Workload Mapping and Scheduling in Heterogeneous HPC Systems
  4. 2026Harmonizing Real-Time Constraints and Long-Horizon Reasoning: An Asynchronous Agentic Framework for Dynamic Scheduling
  5. 2026DynaSchedBench: Calibrated Dynamic Scheduling Benchmarks and Observability Paradox in LLM-based Scheduling Agents
  6. 2024Incorporating Large Language Models into Production Systems for Enhanced Task Automation and Flexibility
  7. 2024LLMs can Schedule
  8. 2024Automated Conversion of Static to Dynamic Scheduler via Natural Language