Research map / Reinforcement learning / Policy gradient and actor-critic
Learning to Optimize Job Shop Scheduling Under Structural Uncertainty
Rui Zhang, Jianwei Niu, Xuefeng Liu, Shaojie Tang, Jing Yuan
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| train critic on hindsight-reconstructed deterministic state (asymmetric actor-critic) (ablation) | UP-AAC with UPM · JSSP 10x10, 1 branch | average makespan: 934.49 -> 846.26 | Improved |
| train critic on hindsight-reconstructed deterministic state (ablation) | UP-AAC with UPM · JSSP 10x20, 3 branches | average makespan: 1434.63 -> 1334.83 | Improved |
| add Uncertainty Perception Model (ablation) | AAC · JSSP 10x20, 3 branches | average makespan: 1369.99 -> 1334.83 (CVaR 1508.02 -> 1457.83) | Improved |
| add UPM to a standard (symmetric) actor-critic without AAC (ablation) | standard AC · JSSP 10x10, 1 branch | average makespan: 930.98 -> 934.49 | Hurt |
| replace standard actor-critic with UP-AAC | standard AC · JSSP large instances 20x20, 3 | average makespan: 1922.53 -> 1884.30 | Improved |
| UP-AAC vs best heuristic baselines on large instances | MWKR/MOR · JSSP large instances | average makespan: 1704.50 -> 1670.13 (15x20, 3) | Improved |
Closest papers by meaning
- DynaSchedBench: Calibrated Dynamic Scheduling Benchmarks and Observability Paradox in LLM-based Scheduling Agents (ICML 2026 · similarity 0.86)
- Learning Memory-Enhanced Improvement Heuristics for Flexible Job Shop Scheduling (NeurIPS 2025 · similarity 0.84)
- Learning-Guided Rolling Horizon Optimization for Long-Horizon Flexible Job-Shop Scheduling (ICLR 2025 · similarity 0.83)
- Neural Combinatorial Optimization for Stochastic Flexible Job Shop Scheduling Problems (AAAI 2025 · similarity 0.82)
- Learning to Optimize Permutation Flow Shop Scheduling via Graph-Based Imitation Learning (AAAI 2024 · similarity 0.82)
- Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling (ICLR 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
