- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes PDScheduler, a neural framework for flexible job-shop scheduling that decomposes action scores into a persistent instance-level prior and a dynamic residual. A masked discrete diffusion model produces an assignment heatmap and structural embeddings. These outputs are reused throughout schedule construction, while a lightweight residual actor adapts decisions to the evolving scheduling state.
Critical strengths
PDScheduler computes an assignment prior and structural embeddings once, then uses a lightweight residual actor to jointly select operations and machines as the schedule evolves. This avoids committing to machine assignments prematurely and reduces repeated global computation.
The method achieves the lowest mean gap in all eight distribution–size settings and improves aggregate performance when transferred to larger instances without retraining.
Critical weaknesses
The ablations do not clearly separate the benefits of diffusion training and policy decomposition from cached embeddings and teacher supervision. Proposition 1 also does not connect the learned heatmap to the ideal projection. This leaves the source of the performance gains unclear.
PDScheduler is faster but has worse aggregate solution quality than the strongest baselines on public FJSP benchmarks. Equal sampling counts do not ensure equal computational budgets. Without matched-time comparisons, the practical quality–efficiency advantage remains unclear.
Questions for authors
Is there a controlled comparison using the same teacher labels, cached encoder, and residual actor, but direct assignment prediction instead of diffusion training?
How do PDScheduler, RESCHED, and DANIEL compare under matched wall-clock budgets on public benchmarks? Does timing include the initial denoiser pass, and is evaluation batching comparable across methods?
6 comments
W2Q2. Public-benchmark quality under matched wall-clock budgets and timing fairness
In the original Greedy and Sampling-100 evaluations, PDScheduler is faster, while RESCHED obtains lower aggregate gaps on the public benchmarks. Since equal sampling counts do not ensure equal computational budgets, we added matched wall-clock comparisons to evaluate solution quality under a common inference budget.
The experiment covers 130 public FJSP instances with five evaluation seeds per instance, giving 650 instance–evaluation-seed runs. We compare PDScheduler, RESCHED, and DANIEL at common checkpoints of 100 ms, 200 ms, 500 ms, 1 s, and 2 s.
For each checkpoint, only complete feasible schedules returned and incorporated into the candidate set before the deadline are counted. The best makespan among these schedules is retained.
Complete-schedule coverage and conditional mean Gap. Coverage is measured over all 650 runs. Mean Gap is calculated only over runs with a completed feasible schedule; “—” indicates that no run completes.
| Budget | PDScheduler Gap (%) | Coverage (%) | RESCHED Gap (%) | Coverage (%) | DANIEL Gap (%) | Coverage (%) |
|---|---|---|---|---|---|---|
| 100 ms | — | 0.00 | — | 0.00 | — | 0.00 |
| 200 ms | 11.112 | 13.08 | — | 0.00 | — | 0.00 |
| 500 ms | 9.244 | 63.08 | 9.632 | 45.23 | 10.343 | 49.23 |
| 1 s | 8.579 | 100.00 | 9.258 | 67.69 | 9.375 | 67.08 |
| 2 s | 7.336 | 100.00 | 7.518 | 100.00 | 7.862 | 100.00 |
At 1 s, PDScheduler returns a complete feasible schedule in every run. Conditional mean gaps at budgets with different coverage are computed on different subsets and should not be interpreted as quality rankings on identical samples.
Comparison on common completed runs. We therefore additionally compare the methods on the subset of runs completed by all three methods at each checkpoint.
| Budget | Common completed runs | PDScheduler Gap (%) | RESCHED Gap (%) | DANIEL Gap (%) |
|---|---|---|---|---|
| 500 ms | 294/650 | 6.791 | 9.632 | 10.256 |
| 1 s | 410/650 | 6.193 | 9.197 | 9.212 |
| 2 s | 650/650 | 7.336 | 7.518 | 7.862 |
Within each row, all methods are evaluated on identical runs. The subset changes across budgets, so values should not be compared across rows as a quality-versus-time trajectory.
PDScheduler obtains lower mean gaps than both baselines on the common completed subsets at 500 ms and 1 s. At 2 s, all methods complete all 650 runs. PDScheduler obtains a mean Gap of 7.336%, which is lower than RESCHED and DANIEL by 0.182 and 0.526 percentage points, respectively.
Timing and batching protocol. All methods were evaluated serially on the same NVIDIA GeForce RTX 5090 GPU. PyTorch intra-operation and inter-operation CPU thread counts were set to one, as were OMP, MKL, and OpenBLAS thread counts.
Each run evaluates one instance, first generating one greedy schedule and then sampling trajectories in batches of eight. Thus, the trajectory batch size and decoding order are matched across methods.
The time budget includes:
- Per-instance environment initialization.
- Input processing and data transfers.
- PDScheduler’s initial persistent-denoiser forward pass.
- Schedule decoding and best-candidate updates.
Persistent outputs are computed once per instance and reused across subsequent trajectories.
Model loading, test-file reading and parsing, and warmup are excluded consistently. All methods use the same warmup procedure: one greedy decode and one sampling batch on the first instance of each benchmark suite. Warmup results are discarded, and the instance state is reinitialized for formal evaluation.
Elapsed time is measured with time.perf_counter(). CUDA synchronization is performed before timing begins, after instance preparation, and after each decoding batch. Each run records results at the five checkpoints up to 2 s.
Only schedules fully returned and incorporated into the candidate set before a checkpoint are included. If a sampling batch crosses a deadline, its results are excluded from that checkpoint. Runs without a completed schedule before the deadline are recorded as having no feasible result.
Under the matched-time protocol, PDScheduler achieves full coverage at 1 s and the lowest aggregate mean Gap among the three methods at 2 s, when all methods achieve full coverage.
Thank you for providing the additional experiments which addresse my previous concerns. But I have one remaining concern: the robustness of the performance gains attributed to "diffusion training." In Table 2, the full model achieves an average makespan of 101.218, compared to 101.488 for the standard masked CE. This difference is relatively small, and the comparison is limited to a single problem scale "SD1 10×5." Could the authors provide more details regarding the distribution of these performance improvements? Furthermore, extending the comparison to other problem scales would help verify whether these gains generalize beyond the current experimental setup.
Should further supplementary analysis support this, I would be open to reconsidering my score.
We thank the reviewer for the specific suggestions concerning controlled ablations, the interpretation of Proposition 1, and matched inference budgets. We have added comparisons that examine the training objective and the source of assignment guidance, clarified the structural ablations, and expanded the public-benchmark evaluation under matched wall-clock budgets. We jointly address each weakness and its corresponding question below.
W1Q1. Separating the effects of diffusion training, teacher supervision, and cached information
To separate these factors, we added controlled comparisons of the training objective and the source of assignment guidance. The Direct Supervised GNN uses the same GNN architecture, RESCHED assignment labels, caching interface, and residual actor architecture as PDScheduler. It replaces diffusion pretraining with standard cross-entropy for direct assignment prediction, and the resulting configuration is trained separately.
We also evaluated standard masked modeling using the same random masking procedure but without diffusion-specific loss weighting. These comparisons distinguish masked reconstruction from direct prediction, and diffusion-specific weighting from ordinary masked CE.
Results on 500 SD1 10×5 instances. Lower mean Cmax is better.
Standard masked CE reduces mean makespan from 103.716 to 101.488 compared with direct supervised prediction, and diffusion-specific weighting provides a further reduction to 101.218.
Direct teacher guidance. As detailed in Appendix A.5 (“RESCHED assignment guidance”), we replace the predicted heatmap scores with smoothed log-probabilities derived from RESCHED machine assignments, while retaining cached structural embeddings, the RL-trained residual actor, and the EFT bias. Other compatible machines remain selectable, allowing the actor to revise teacher assignments during schedule construction.
This variant obtains a mean makespan of 104.142, compared with 101.218 for PDScheduler. The comparison isolates the source of explicit assignment guidance while retaining learned structural embeddings, and is distinct from evaluating the complete RESCHED policy.
Updated structural ablations. We have corrected the structural-ablation results and clarified the interventions for the key variants:
These definitions distinguish information removal from disabling a network component. In particular, Static only retains a state-dependent EFT preference.
The results support the contribution of cached structural information and state-dependent scoring in the tested configuration.
Proposition 1. As clarified in our response to Reviewer fMVK, Proposition 1 characterizes the optimal state-independent approximation to prescribed logits under a fixed state distribution. The learned heatmap is trained from reference assignments and is not assumed to equal this ideal projection. The controlled comparisons above assess the empirical contributions of the training objective, the source of assignment guidance, and cached structural information. (continued in next comment)