- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Align-and-Improve (AAI) for asynchronous dynamic job-shop scheduling, where a fast dispatching policy continues executing while a slower LLM produces candidate rules. AAI combines Late State Binding (LSB), which attaches the latest observed state when a request is claimed. Verified Plan Update (VPU) accepts a candidate continuation only after checking feasibility improvement over the incumbent and consistency at commitment. And Rollout-Based Action Arbitration (RAA) compares the retained plan’s next action against the fast policy under a shared continuation policy. Experiments cover 58 instances from four benchmark families and demonstrate the effectiveness of the proposed method.
Critical strengths
- The paper addresses a meaningful deployment problem with a coherent separation of concerns. A proposal can become stale while awaiting generation, remain feasible but inferior when returned, and lose its advantage during subsequent execution.
- VPU includes careful safeguards for concurrent execution. Evaluating the incumbent and candidate on the same state, preserving running operations, and rechecking state and plan consistency before commitment are appropriate measures. The paper also correctly limits its guarantee to the evaluated continuation and acknowledges that later events can reverse the benefit.
- The results provide meaningful evidence of improvement over the matched RACE controls.
Critical weaknesses
- The incremental contribution over existing validation and rollout mechanisms is insufficiently established. RACE already evaluates candidate and incumbent policies in a sandbox and uses feasibility and improvement criteria before atomic deployment. The paper should explain this distinction more explicitly and clarify whether its RACE control preserves the original validator, acceptance thresholds, and other relevant components.
- Real-time suitability and total computational efficiency remain unverified. RAA can perform two continuation rollouts before each dispatch, while VPU introduces native search and plan verification. Token counts omit these costs. The paper does not provide sufficient end-to-end latency or scaling measurements to determine whether the method preserves the fast stream’s responsiveness.
- The evidence for LSB is substantially narrower than the motivating staleness problem. It does not establish that actual LLM requests incorporate the intended snapshot or that waiting-time staleness materially affects deployed performance.
- The evaluation does not yet establish a clear advantage over the strongest non-LLM alternative. A matched quality–runtime comparison with strong non-LLM optimization and rollout baselines would be more informative.
Questions for authors
Please refer to the weaknesses.
Authors response?
Dear authors,
Author-reviewer discussions end on November 18th. Please submit your responses to the reviewers reviews as soon as possible, so the reviewers would be able to respond to you.
Thank you.