- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes the Transition-Aware Dual-Scale Solver (TADS) for constructive scheduling. Each feasible action is represented as a set of typed edits that, when applied to the current state, reconstruct its canonical successor. These edits are encoded into transition embeddings, and candidate actions are evaluated using global recurrent memory and local attention over candidates. The selected action’s embedding is fed into the next memory update. Experiments cover six scheduling formulations, including synthetic instances and public benchmarks, with component ablations and efficiency analyses. The reported results support the effectiveness of TADS.
Critical strengths
-
TADS represents candidate actions through the state changes they induce and reuses the selected transition embedding to update memory. This connects action evaluation with subsequent decisions, allowing the model to incorporate executed action effects into its scheduling context.
-
The dual-scale encoder combines global recurrent memory with local attention over candidate actions, enabling decisions to account for both historical context and current competition among candidates. Experiments across six scheduling formulations, including synthetic instances and public benchmarks, together with component ablations, provide empirical support for this design.
Critical weaknesses
-
Transition completeness follows from recording all changed fields and reconstructing derived information under the stated assumptions. Although the representation comparisons support the effectiveness of edit encoding, they do not isolate completeness itself as the source of improvement. This limits the theoretical contribution and leaves its connection to scheduling performance unclear.
-
The main text introduces many symbols and equations for relatively straightforward operations, such as recording changes and pooling features. This increases the reading cost and makes it difficult to identify the substantive novelty beyond combining transition features, recurrent memory, and candidate attention.
Questions for authors
-
What evidence distinguishes the benefit of transition completeness from the benefit of explicit change encoding? The representation comparisons show performance differences, but full-successor representations also contain complete successor information.
-
What is the benefit of feeding the selected transition embedding into memory, beyond updating memory from the current state summary?
3 comments
Thanks for your detailed response and additional experiments. Through my deep thinking, I'll maintain my score.
Dear Reviewer,
Thank you for taking the time to reconsider our revised manuscript and additional experiments. We sincerely appreciate your careful assessment and respect your perspective.
We would like to emphasize that we have directly addressed the central concerns raised in your original review. Specifically, we have clarified the theoretical role of symbolic completeness, introduced controlled comparisons to distinguish its role from the empirical benefits of explicit change encoding, and independently evaluated the contribution of executed-transition feedback beyond the current state summary. We have also substantially simplified the Methods to make the substantive contribution clearer.
Beyond the empirical improvements, we believe TADS offers a meaningful contribution to neural combinatorial optimization and scheduling by introducing a transition-centered decision framework that explicitly models candidate action consequences and reuses executed-transition information to guide subsequent decisions. This provides a reusable perspective on sequential decision-making in scheduling, where each action affects future resource availability and feasible choices.
We sincerely hope that these targeted revisions and additional evidence have satisfactorily addressed your original concerns and demonstrated the value of our contribution. If so, we would be truly grateful if you could reconsider your overall rating in light of these improvements.
Thank you again for your time and thoughtful consideration.
Response to Reviewer WaL2: Completeness, Feedback, and Contribution
Dear Reviewer,
Thank you for your insightful comments on completeness and our contribution. We distinguish theoretical guarantees from empirical gains. All revisions are highlighted in blue in the re-uploaded revised PDF.
W1: Theoretical role and link to performance. Section 4.1 and Appendix C.1 establish exact reconstruction from the current state and symbolic edits, before learned pooling. This gives task-specific compilers a common, testable contract and permits unchanged state to be shared across candidates. Table S13 (Appendix E.3) reuses Table 5's zero-feedback transition-complete (TC) and full-successor (FS) checkpoints on identical flexible job-shop scheduling problem (FJSP) instances with the same backbone and greedy decoding. TC achieves 0.12–0.14 percentage points (pp) lower mean Gap, 1.23–1.30× speedup, and 17%–25% lower peak GPU memory allocation. Latency includes feature preparation, compilation or successor construction, inference, selection, and execution. The theory supports an exact sparse interface; its scheduling value is demonstrated through joint quality–cost gains.
Q1: Completeness versus explicit change encoding. TC and Primary are both symbolically complete: each retains all primary writes and reconstructs derived information deterministically; TC additionally exposes derived events. Their contrast preserves reconstructible successor information while varying its explicit exposure. Timing keeps timing edits only; FS encodes complete successors. All four preserve the same simulator rules; Table 5 fixes zero feedback, backbone, training, and test instances. At 40×10, Primary−TC is 0.23 pp (derived events), Timing−Primary 0.32 pp (field coverage), and FS−TC 0.13 pp (change encoding). The same ordering holds at smaller sizes. These controls support explicit change encoding as the empirical source of gains.
Q2: Feedback beyond state-summary updates. Memory receives a compressed summary of the Markov state; transition feedback supplies the selected action's committed change directly (Section 4.2). Zero still updates memory from the current state summary. We retain the TC candidate representation and recurrent/local backbone, changing only feedback: selected transition embedding (Transition), zero vector (Zero), or pre-decision action embedding (Action). Each variant is trained independently with five seeds under its feedback rule in both training and evaluation. Only the selected candidate supplies feedback. At 40×10, Transition's mean Gap is 0.39%, versus 0.68% for Zero and 0.53% for Action: gains of 0.29 and 0.14 pp. Action also improves on Zero by 0.15 pp. Thus, Zero tests value beyond state-summary updates; Action tests consequence encoding against a generic feedback channel. Table 4 reports means and standard deviations (SD), with Transition lowest across all six tasks.
W2: Revised exposition and substantive contribution. To address your concern about notation obscuring novelty, we reorganized and simplified the Methods around compile–compare–execute–reuse. Section 4.1 retains two equations instead of five: symbolic reconstruction and transition embedding. Encoding/pooling details and reconstruction are in Appendices B.3.1 and C.1. The contribution is a sparse transition interface linking candidate evaluation to subsequent memory updates: it shares unchanged state and reuses the selected pre-attention embedding without re-encoding. Pooling, recurrence, and attention implement this flow. These changes reduce main-text formalism and foreground the substantive interface and reuse mechanism.
We sincerely appreciate your careful review, which helped clarify our contribution, simplify the presentation, and distinguish reconstruction from policy gains. If these revisions resolve your concerns, we would be grateful if you would consider revisiting your overall assessment. We welcome questions about the revised claims or results.