- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes CausaSched, a causal-guided deep reinforcement learning hyper-heuristic framework for multiple shop scheduling problems. The authors suggest identifying the sources of delays in the current schedule and then using an operation selection network to make adjustments. The experiments were conducted on several public scheduling benchmarks and mixed synthetic datasets, comparing it with DRL constructive methods and traditional boosting methods. The results show that CausaSched can achieve better makespan optimization in most test scenarios.
Critical strengths
- The motivation is well-grounded, and the idea of locating intervention targets via delay propagation provides a fresh perspective for learning-based scheduling optimization.
- The cross-problem generalization design is systematic, and evaluations on multiple public benchmarks verify its empirical effectiveness.
Critical weaknesses
- The so-called "causal reasoning" is essentially learned weight propagation along scheduling dependencies, not formal causal inference. The paper provides neither strict counterfactual effect estimation nor empirical proof that LCT-identified targets are truly the root causes of makespan delay.
- The paper compares an iterative improvement method against one-pass constructive DRL baselines, which have completely different computational paradigms and inference budgets. Meanwhile, it lacks full head-to-head comparison with state-of-the-art DRL improvement methods (e.g., MIStar for FJSP).
- Employing multi-trajectory search and candidate intervention mechanisms during inference may incur additional computational overhead.
- A scheduling graph does not necessarily represent true causal relationships; instead, it may primarily reflect feasibility constraints. Consequently, what the LCT learns is likely correlation within the graph structure rather than genuine causal influence.
- All ablations are conducted at inference time on a fixed checkpoint, without retraining ablated variants. This only proves component importance for the current trained weights, not their necessity during learning.
Questions for authors
See Weaknesses.