Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutions
Published in Transactions on Machine Learning Research, 2026
CDQAC is an offline RL algorithm for job shop and flexible job shop scheduling that learns effective policies from historical data without any simulator. It matches or beats state-of-the-art online and offline RL baselines from only 10–25 training instances, generalizes to instances ten times larger than those seen in training, and performs best when trained on solutions generated by a random heuristic.
Recommended citation: van Remmerden, J., Bukhsh, Z., & Zhang, Y. (2026). Generalizing Beyond Suboptimality: Offline Reinforcement Learning Learns Effective Scheduling through Random Solutions. Transactions on Machine Learning Research.
Download Paper
