Scalable Production Scheduling: Linear Complexity via Unified Homogeneous Graphs

ArXi:2604.23841v1 Announce Type: new Efficiently solving the Job Shop Scheduling Problem in real-world industrial applications requires policies that are both computationally lean and topologically robust. While Reinforcement Learning has shown potential in automating dispatching rules, existing models often struggle with a scalability bottleneck caused by quadratic graph complexity or the architectural overhead of heterogeneous layers. We