- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposed a LLM-based modeling system, specifically for hot rolling scheduling for steel manufacturing. A large knowledge base is pre-built about how different types (components) of variables, constraints and objectives would look like, and the connection between them (e.g., to use a specific objective component, certain variables must be created in advance). When prompted to generate an optimization model, the system use RAG to fetch candidate components from the knowledge base, and constructed the model based on thses components.
Critical strengths
- This paper addressed an important optimization problem in real world
- The performance on the proposed scenario (hot rolling scheduling for steel manufacturing) is impressive
- This paper suggests that a well-crafted, structured knowledge base can significantly improve the performance of LLM OR modeling
- While the paper is very narrowly scoped on the hot rolling scheduling problem, I guess it also applies on other type of industrial OR scenarios.
- Sufficient details
Generally speaking, I would praise it as a solid white paper, illustrating a domain-specific enterprise practice on AI for OR.
Critical weaknesses
- The proposed approach heavily relies on a well-crafted knowledge base with sufficient expert knowledge. I guess this is the reason why this paper is narrowly scoped on the hot rolling scheduling problem for steel manufacturing.
- This paper would be much more impressive if the proposed approach can be paired with a (semi-)automatical knowledge base generation system, and experiment on standard AI for OR benchmarks covering more scenarios.
- Most of the techniques used in the paper, like RAG, structured KB, component composition and solution verification, are not new. This is less problematic or even encouraged in enterprise practice, but could be a very critical problem as a research paper, especially in venues like ICLR.
- I suggest submitting to more application-oriented venues if the authors do not plan for a major revision.
Questions for authors
See "weaknesses"
Thank you for recognizing the practical relevance and performance of our work.
The agent extracts formulas with explanations and source locations from the 20 training studies, groups them into decision, constraint, and objective components, and records production meanings and source-supported connections. Programmatic modeling validation verifies formula ownership and source references. Component grouping and connection recording are automatic; human input concerns source preparation, initial organizational guidance, and ambiguous production meanings.
We agree that broader evaluation is important and appreciate this recommendation. Component Selection and Component Composition are designed for industrial OR scheduling, with HRSP as the primary evaluated application. Transfer requires domain-specific formulations, production semantics, and data mappings. We will evaluate kettle and filtration scheduling using new component libraries and the same modeling mechanisms.
The challenge is preserving production meaning as requirements change. Industrial scheduling combines context-dependent production rules with decisions coupled across stages. Relevant formulas can still introduce inappropriate restrictions, omit requirements, or leave decisions incorrectly connected. Such errors change the intended production problem even when the generated model remains solver-feasible.
Our contribution is to identify and correct these errors during model construction. Bidirectional selection checks component applicability and requirement coverage: forward matching assesses candidates against target requirements, while reverse review recovers uncovered requirements and incorrectly rejected components. Executable composition traces dependencies through auxiliary definitions and uses solver-generated counterexamples to identify declared stage relations not enforced by the assembled constraints. Missing connections trigger composition correction; missing decision dependencies trigger selection review.
The results demonstrate more precise responses to production changes. DeepSeek + RAG matches our change recall of 0.933, but its change precision is 0.250 versus 1.000 for ours: it recovers required updates while also introducing unsupported changes. Across the expanded comparison, including ORThought, MIRROR, OptiMUS, CoE, and AlphaOPT, change F1 is at most 0.394, compared with 0.966 for our method. These results support the value of explicitly maintaining requirement–component correspondence beyond retrieving relevant knowledge.