- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SchedGPT, a unified autoregressive learning framework for several list-scheduling problems, including Job Shop Scheduling (JSP), Flexible Job Shop Scheduling (FJSP), and Workflow Scheduling (WSP). The key idea is to represent different scheduling instances using a common heterogeneous graph consisting of task and processor nodes, and to encode scheduling solutions as aligned task-priority and processor-assignment lists. A deterministic schedule builder then converts these lists into feasible schedules. The model is trained using policy gradients with a rollout baseline to minimize makespan. Experiments on multiple scheduling benchmarks demonstrate competitive performance against specialized learning-based schedulers, particularly when the model is trained separately for each problem family.
Critical strengths
-
Meaningful problem and unified formulation. The paper proposes a common learning framework for scheduling problems that have traditionally been studied separately. The unified task–processor representation and priority-list-based solution construction provide a coherent approach to accommodating different precedence structures and processor compatibility constraints.
-
Reasonable and well-structured framework. The proposed architecture integrates graph representations, autoregressive decision-making, and deterministic schedule construction in a natural manner. In particular, separating learned task–processor decisions from feasibility-preserving schedule construction is a sensible design choice. The overall methodology is clearly motivated and relatively easy to follow.
Critical weaknesses
-
Insufficient evidence for the foundation-model and generalization claims. The strongest results are obtained by SchedGPT-S, which uses separately trained parameters for different problem families. In contrast, the jointly trained SchedGPT-U exhibits noticeable performance degradation and falls behind the strongest specialized baselines across the evaluated domains. Additional experiments on unseen scheduling variants, cross-domain adaptation, or fine-tuning efficiency would make the foundation-model positioning more convincing.
-
Incomplete validation of some important design choices. The current evaluation would benefit from more targeted ablations examining the contributions of the autoregressive GPT decoder, heterogeneous graph encoder, and engineered dynamic features.
-
Limited methodological novelty relative to existing work. While the overall integration is meaningful, several key components, including heterogeneous task–processor graphs, priority-list-based schedule construction, attention-based task and machine selection, and autoregressive neural combinatorial optimization, have been explored in prior studies. The paper's main novelty therefore appears to lie primarily in combining these ideas into a common framework spanning multiple scheduling families. A clearer discussion of the technical advances beyond these existing approaches would strengthen the contribution.
Questions for authors
-
Could the authors further clarify the main methodological differences between SchedGPT and existing approaches such as HGNN, ReSched, and priority-based neural DAG scheduling? In particular, which aspects of the unified representation and autoregressive construction are fundamentally different from existing scheduling methods? It would also be helpful to clarify the conceptual advances over unified neural combinatorial optimization frameworks such as RouteFinder.
-
The results suggest that SchedGPT-U can accommodate multiple scheduling families, but with a performance reduction relative to SchedGPT-S. Have the authors investigated whether joint training provides benefits beyond architectural unification, such as improved sample efficiency, transfer to unseen problem variants, or faster adaptation through fine-tuning? Such results would help substantiate the foundation-model claim.
-
How much improvement is attributable specifically to the autoregressive GPT decoder compared with a simpler state-conditioned pointer network or non-autoregressive alternative? It would also be useful to report inference latency and computational scaling with the number of tasks, especially relative to one-shot priority-based scheduling methods.
-
Dynamic features for general DAG workflows. Appendix B.2 defines the frontier-operation set and several progress-related features using job-specific operation indices, which appear naturally suited to JSP/FJSP. However, general workflow DAGs may contain multiple simultaneously ready successors and do not necessarily admit the same job-chain representation. Could the authors clarify how these dynamic features are defined and implemented for WSP? Are any domain-specific feature adaptations required?
I would be open to reconsidering the rating if the authors can provide convincing evidence of cross-domain transfer or adaptation benefits and clarify the implementation and methodological concerns above.