cs.AIOct 19, 2026

CoRS: Fast Neural Flexible Job-Shop Scheduling via Composite Interval State Reuse

Authors: Jiang Sutong, Zhao Peng, Wu Xuan, Wang Yan, Wang Jiaqi, Zhang Rui, Jiang Yuan, Zhou You, 

Organizations: College of Computer Science and Technology, Jilin University, China · College of Software, Jilin University, China · College of Computing and Data Science, Nanyang Technological University, Singapore · Joint NTU-UBC Research Center of Excellence in Active Living for the Elderly, Nanyang Technological University, Singapore

Abstract

Neural solvers for the Flexible Job-Shop Scheduling Problem (FJSP) typically refresh graph representations and update feasibility after every operation--machine decision. However, only feasibility must remain exact at every step, whereas graph encoding is substantially more expensive and can potentially be refreshed less frequently. We present CoRS, which decouples them: an interval-level graph representation is reused across multiple sequential decisions, while a stepwise feasibility state is updated after every action. This two-timescale design amortizes graph encoding without parallelizing action generation or relaxing scheduling constraints. CoRS further develops a feasibility-preserving composite-interval decoding scheme with dynamic constraint tracking and boundary state synchronization, which reduces representation refresh frequency while maintaining continuous feasible schedule construction. Furthermore, to alleviate representation staleness caused by interval-level state reuse, CoRS introduces enhanced static features as a compensation mechanism. By providing more comprehensive structural information of the scheduling problem, these features improve the model's perception of overall problem characteristics. Extensive experiments on synthetic and multiple public FJSP benchmarks demonstrate that CoRS significantly reduces inference time while maintaining competitive solution quality, achieving favorable speed-quality trade-offs under tight wall-clock budgets and low-latency scenarios.

Figures & tables

Explore similar work

CardsList
  1. RESCHED: Rethinking Flexible Job Shop Scheduling from a Transformer-based Architecture with Simplified States

    Mar 7, 2026Xiangjie Xiao, Cong Zhang, Wen Song +1Flexible Job Shop SchedulingJob Shop Scheduling

  2. Graph-RHO: Critical-path-aware Heterogeneous Graph Network for Long-Horizon Flexible Job-Shop Scheduling

    Apr 11, 2026Yujie Li, Jiuniu Wang, Mugen Peng +2Flexible Job Shop SchedulingJob Shop Scheduling

  3. PLAN: Parallel Liquid-Inspired Approximation Network for Efficient Representation Learning in Flexible Job Shop Scheduling

    Aug 4, 2026Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi +5Efficient Neural Network InferenceLiquid Neural Networks