PLAN Boosts Job Shop Scheduling Efficiency with Parallel Liquid Networks

Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi, Yingpeng Du, Tianjun Wei, Jie Zhang, Zuming Liu, Anupam Trivedi· August 5, 2026 View original

Key takeaways

  • PLAN offers a highly efficient and lightweight alternative for flexible job shop scheduling.
  • It significantly reduces inference latency and model parameters compared to attention-based DRL.
  • The network improves scheduling makespan across various FJSP complexities.
  • PLAN's parallelizable architecture makes it suitable for large-scale industrial applications.

Who benefits

ManufacturingLogisticsSupply ChainAutomotiveAerospace

Summary

This paper introduces PLAN, a Parallel Liquid-inspired Approximation Network, designed to improve flexible job shop scheduling (FJSP) by offering a parameter-efficient and computationally faster alternative to attention-centric deep reinforcement learning models. PLAN reformulates liquid neural network dynamics for parallel processing, significantly reducing inference latency and parameter count while improving scheduling makespan.

Deep reinforcement learning (DRL) has achieved state-of-the-art results in flexible job shop scheduling (FJSP), but current attention-based models are often too large and slow for practical, large-scale applications. This research proposes PLAN, a Parallel Liquid-inspired Approximation Network, which tackles these limitations by re-imagining liquid neural network (LNN) dynamics into a parallelizable, discrete form. PLAN separates the evolving state representation, handled by liquid-inspired updates, from global context aggregation, managed by a lightweight module. PLAN acts as a flexible backbone, adaptable to various FJSP complexities, including stochastic and multi-faceted dynamic scenarios. Extensive testing across these benchmarks shows PLAN reduces average makespan by 1.2% to 2.3% compared to leading baselines, with some improvements reaching over 10%. Crucially, it also slashes average inference latency by 13.2% to 31.7%, and up to 69.2% on larger instances, all while using only 22-47% of the parameters of its counterparts.

Why it matters

For industries relying on complex scheduling, PLAN offers a significant leap in efficiency and speed for job shop scheduling, enabling faster decision-making and better resource utilization with fewer computational resources. This can lead to substantial cost savings and improved operational throughput.

How to implement this in your domain

  1. 1Evaluate current job shop scheduling processes for bottlenecks related to model complexity or inference latency.
  2. 2Consider integrating PLAN as a plug-and-play backbone for existing DRL scheduling systems.
  3. 3Benchmark PLAN's performance against current scheduling solutions using your specific operational data.
  4. 4Explore its application in stochastic or dynamic FJSP variants if your operations involve high variability.
  5. 5Train and deploy PLAN to optimize resource allocation and reduce makespan in production environments.

Original post by Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi, Yingpeng Du, Tianjun Wei, Jie Zhang, Zuming Liu, Anupam Trivedi

"arXiv:2608.03041v1 Announce Type: new Abstract: Deep reinforcement learning (DRL) approaches for flexible job shop scheduling (FJSP) heavily rely on attention-centric architectures to achieve state-of-the-art performance. However, these models suffer from excessive parameter coun…"

View on X

Originally posted by Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi, Yingpeng Du, Tianjun Wei, Jie Zhang, Zuming Liu, Anupam Trivedi on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses