- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a Constraint-Relational Scheduling Transformer (CRST) to solve the complex hierarchical manufacturing scheduling problem. CRST employs three relation-specific branches to model workflow, task–machine, and task–resource interactions, which are integrated through Relation Mix. A pair decoder scores feasible assignments, while an event-driven environment ensures feasibility and bounded-context decomposition reduces memory consumption during large-scale inference. Experimental results on four synthetic industrial-inspired scenarios demonstrate that CRST achieves competitive makespan performance compared with CP-SAT.
Critical strengths
S1: The proposed architecture has a clear motivation and a coherent design.
S2: The experimental results demonstrate promising performance on four synthetic datasets.
Critical weaknesses
W1: Recent learning-based scheduling methods [1,2] increasingly focus on developing unified solvers capable of handling multiple problem variants. However, CRST is designed and evaluated exclusively for a single hierarchical manufacturing scheduling problem. The authors are encouraged to evaluate CRST on other scheduling problems, such as standard FJSP and JSP, to demonstrate its versatility and generalizability.
W2: The manuscript lacks sufficient sensitivity analysis of key hyperparameters, particularly those associated with the proposed bounded-context decomposition strategy, such as the context size, action-core size, and rolling commitment interval.
W3: The presentation of Figure 1 could be improved. A clearer vector-based illustration would make the overall architecture easier to follow and help readers better understand the workflow of the proposed model.
[1] RESCHED: Rethinking flexible job shop scheduling from a transformer-based architecture with simplified states. ICLR 2026.
[2] Towards a Unified Model for Flexible Job Shop Scheduling Problems. NeurIPS 2026.
Questions for authors
see Weaknesses
2 comments
Thank you for your responses. I will maintain my original rating.
Response to Reviewer 766o
We thank the reviewer for the constructive comments. Our responses are given below.
Our goal differs slightly from unified multi-problem solvers [1,2]: rather than covering many problem classes with one model, CRST targets a family of FJSP variants with workflow, machine, and resource constraints. Standard FJSP is a special case of this family, and JSP is a further special case with a single eligible machine per operation, so CRST applies to them without architectural changes. Following the reviewer's suggestion, we tested CRST in two additional settings.
(1) Standard FJSP. We compared CRST with the recent learning-based FJSP methods DANIEL and ReSched on the DPP, Fattahi, and Hurink benchmarks. CRST obtains the lowest gap on some sets at comparable runtime (gap %, runtime):
(2) A different real-world problem. We further applied CRST, without retraining, to the published aircraft disassembly benchmark of Thomas and Schaus (2026), built from real operational data. It contains constraints that CRST does not model (technician capacity per location, technician unavailability, and mass balance); these are enforced by the environment through action masking and delayed start times, while the network is used unchanged. Gaps are relative to the authors' published CP Optimizer results (all constraints, 1 h):
On instances with 200 or more operations, CRST is within 1.0–4.9% of CP Optimizer while using at most 236 s instead of 1 h.
We varied the context size H, the action-core size A, and the rolling commitment interval S one at a time around the default (H = 200, A = 150, S = 50). Changes are relative to the default, with paired 95% bootstrap CIs:
Two observations follow. First, H has no significant effect on quality across 150–1,000, while peak GPU memory grows from 50.6 MB to 403.8 MB, so a small context is sufficient. Second, A and S matter only through the overlap A − S, i.e., the planned tasks that are not committed and can be replanned in the next window. Whenever A − S ≥ 50, makespan stays within 0.71% of the default; with overlap 25 (A = 75 or S = 125) it degrades by 1–2%, and with no overlap (A = S) it degrades sharply. The method is therefore robust over a wide range of settings, provided that some overlap is retained. We will add these results to the appendix.
Thank you for the suggestion. We will redraw Figure 1 as a clearer vector graphic in the revised version, so that the overall architecture and workflow of CRST are easier to follow.