- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper introduces an end to end DRL approach to solve the flexible job shop scheduling problem. It proposes a new dual attention network. It achieves lower makespan on different sized FJSP instances in comparison to benchmarked dispatching rules and two existing learning based approaches.
Critical strengths
- The dual attention network is interesting. The architecture offers a new perspective on how one could transfer the state into a state that is learnable by a transformer.
- The proposed approach solves the unseen instances better than the benchmarked methods.
Critical weaknesses
-
The proposed dual attention mechanism is interesting, and the authors show it outperforms the existing DRL approaches Resched and DANIEL. However, the proposed model is much larger and requires much more training than Resched and DANIEL: the trained model uses 8 transformer-layers with dimensionality 1028 and 200 million parameters, while training on 8 GPUs that each have 96 GB RAM. To compare, DANIEL is very lightweight with about 28,000 parameters. Resched also uses some transformer layers but only 2 with a dimensionality of 128 and a total of about 800 thousand parameters, while training on a single GPU with 48 GB of memory. Hence, it is unclear where the power of learning a broader set of instances comes from: is it because the proposed dual attention network is much more effective than the previously used ones in the literature, or simply because the network is so much bigger than other benchmarked methods? So, to prove the value of the proposed network, the authors should ideally compare at least with a very large version of Resched and maybe also a smaller version of their network. They should clearly show this comparison for different sizes of architectures to see how performance is affected.
-
It is quite unclear how the authors use the OR-Tools in the training. They only say they use it so "align" but don't specify clearly how this is done. Having to use many or-tools solutions for training in itself is already a disadvantage, as it requires a lot of compute just for this labelling, similar to how this can become an issue for supervised approaches. The authors should at least show the effect of not using the reference solutions in the experiments.
-
For the very large instances, the authors didn’t report the solution quality of OR-Tools, and the experiment is done only for one instance.
-
The authors claim the proposed online mask, that incorporates scheduling information during policy execution, is a contribution. However, to me, it seems not novel and such masking is used by other DRL approaches too.
-
Some part of writing is sloppy. Some notation uses * instead of _ in several formulas. The Gannt charts are also very poorly explained.
Questions for authors
See Weaknesses.
4 comments
Response to Critical Weaknesses & Questions:
Q1. Matched Model Size.
Due to training-time constraints, we could not train a full-scale ReSched model. Instead, we trained a smaller AnyFJS variant matched to ReSched's model capacity. The capacity-matched AnyFJS (828,801 deployed parameters) and ReSched (821,185) were trained on the same 160,000 instances. Of the 217 evaluation instances, ReSched completed only 205 within the prescribed time limit. Accordingly, we compare their group-averaged gaps on the 205 instances completed by both methods, spanning 41 groups. With training seed 43 and matched inference budgets, AnyFJS achieved a lower average gap than ReSched (20.02% vs. 20.33%). Together, the higher feasibility coverage and lower solution gap support the effectiveness of our proposed operation–machine cross-attention, bilinear scoring head, and online masking mechanism, demonstrating their advantages in both solution feasibility and quality under matched model capacity.
Q2. Solver Labels and Cost.
OR-Tools serves only as an evaluation reference (baseline); it does not participate in training and provides no rewards, advantages or labels. We will correct the descriptions in the abstract and Section 3.3.
Q3. Instances.
CP-SAT returned UNKNOWN without a feasible schedule on these inputs.
Table R5. Four instances. One greedy run per input with the submitted checkpoint on one H20 (inference seed 4201). Time and peak allocated GPU memory are for AnyFJS. MPGN had the lowest baseline makespan within each time budget.
| Instance | Ops. | Lower Bound | AnyFJS Makespan | Time (s) | Peak (GiB) |
|---|---|---|---|---|---|
| L0046 | 8,800 | 4,641 | 4,681 | 1,332.66 | 14.05 |
| L0017 | 9,000 | 4,660 | 5,246 | 1,389.31 | 14.36 |
| L0115 | 9,000 | 4,542 | 5,178 | 1,385.13 | 14.36 |
| L0155 | 11,000 | 5,781 | 6,510 | 2,190.20 | 17.45 |
Q4. Mask and Contribution.
We agree that feasibility masking is established practice. The dispatch mask enforces precedence and machine eligibility. Our architectural choices concern how each operation aggregates machine-specific processing times, how global context is introduced, and how one bilinear matrix scores all operation–machine pairs.
Q5. Notation and Gantt Charts.
Thank you for reminding us of the mistake. We have corrected the original subscript. We will provide more detailed explanations for the Gantt chart.
Thank you for your answers.
- The authors didn't compare with similar sized DANIEL. My original concern on whether performance gains come from a much larger architecture stays.
- OR-Tools is used to generate labels for training. As my initial review indicated, the authors should at least show the effect of not using these reference solutions in the experiments. As far as I can see, this point is not addressed by the authors.
- I still don't get a good picture of the performance on large instances: for sizes of 100x20, the method is only compared with OR Tools but not any other NCO methods (i.e., DANIEL, HGNN etc, which can be easily applied); For the instance 100x100, it is compared with other NCO methods, but not all PDRs.
I will therefore maintain my original score.
### Response to Reviewer uj3G
We thank the reviewer for the constructive follow-up comments. We address the three main concerns with additional experiments and clarifications. Q1. Capacity-, Data-, and Training-Budget-Matched Comparison. We retrained DANIEL and ReSched with comparable policy-parameter budgets to AnyFJS, using the same 160k generated training stream and 14,400 s training-time cap.
| Method | Parameters | Avg. Gap%↓ | Verified Feasibility |
|---|---|---|---|
| AnyFJS | 2,424,801 | 9.93 | 217/217 |
| DANIEL | 2,442,805 | 12.24 | 217/217 |
| ReSched | 2,466,049 | 20.80 | 217/217* |
| | |||
| ReSched's 217/217 feasibility was obtained with an extended inference-time budget and represents eventual feasibility. | |||
| | |||
| Our complete solver achieves the lowest average gap, outperforming DANIEL by 2.31 percentage points and ReSched by 10.87 percentage points. These results demonstrate stronger solution quality under matched model capacity and training resources, while the extended inference budget for ReSched is explicitly distinguished. | |||
| | |||
| Q2. Clarification of OR-Tools Usage. | |||
| | |||
| We apologize for the misleading description in the original manuscript. OR-Tools is used exclusively to generate evaluation references; it does not participate in training or provide rewards, advantages, or labels. PPO training uses the negative partial-makespan increment as the reward, with advantages estimated from sampled returns and critic predictions. | |||
| | |||
| Therefore, the requested experiment removing OR-Tools supervision is not applicable, as our training already uses zero OR-Tools supervision. This was a textual error rather than an experimental dependency. We will correct the abstract and Section 3.3 accordingly. | |||
| | |||
| Q3. Additional Large-Scale Comparisons. | |||
| | |||
| 100×100 (Completed). Following the reviewer's suggestion, we added three priority dispatching rule (PDR) baselines—FIFO, MOPNR, and MWKR—on the same single instance reported in the original paper, without introducing additional 100×100 instances. | |||
| | |||
| Method | Makespan ↓ | ||
| --- | ---: | ||
| AnyFJS | 4,652 | ||
| FIFO | 8,099 | ||
| MOPNR | 8,131 | ||
| MWKR | 8,151 | ||
| | |||
| AnyFJS reduces makespan by 42.56%, 42.79%, and 42.93% relative to FIFO, MOPNR, and MWKR, respectively, providing additional evidence of its effectiveness on this large-scale instance. | |||
| | |||
100×20 (Additional comparison). On instance gen_0023 ((k=3, 2,000 operations), AnyFJS achieves a makespan of 4,911, compared with DANIEL (4,944), MPGN (4,964), HGNN (5,017), ReSched-PPO (5,041), FIFO (5,011), MOPNR (5,068), MWKR (5,082), and SeEvo (6,349). | |||
| | |||
| These additional results complement our original large-scale evaluation and demonstrate competitive solution quality against both learned schedulers and conventional dispatching rules on the evaluated instances. | |||
| | |||
| We thank the reviewer again for the suggestions, which have helped strengthen our experimental evaluation and clarify the actual training procedure. |
Response for Summary and Strengths:
Thank you for identifying the capacity comparison and the distinction between our two large-instance evaluations.
We appreciate your assessment of the state representation and the zero-shot benchmark comparison.