- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper studies multi-objective flexible job shop scheduling, aiming to generate schedules that reflect different objective preferences using a single neural policy. Building on the DCAN framework, the authors propose AC-PC, which uses a shared conditional encoder to encode the scheduling state at fixed preference anchors. Independent actors score candidate operation–machine pairs, and their scores are combined according to the requested preference. A preference correction network uses the mixed hidden features and the requested preference to refine candidate action scores. The entire policy is trained jointly using PPO.
The contributions include preference-conditioned composition of independent action scores, action-level preference correction, and systematic experimental validation of the design. The experiments cover different numbers of objectives, instance sizes, public benchmarks, and other scheduling problems. They demonstrate hypervolume improvements over DCAN in most tested settings and examine the roles of individual components through ablations, actor-parameter-matched comparisons, and PC-on/off analyses.
Critical strengths
-
The paper proposes a clear and practical preference-conditioned design at the action-scoring level. It combines independent actor scores at fixed preference anchors so that different scoring branches jointly contribute to objective trade-offs, then uses the current state and the requested preference to correct the score of each candidate action. The design clearly separates score composition and score refinement, with both components trained jointly through a single policy, providing a well-structured approach to multi-objective scheduling that is straightforward to implement.
-
The experimental evaluation is generally comprehensive, covering two-, three-, and four-objective settings, different instance sizes, public benchmarks, and other scheduling problems such as FFSP and JSSP. In the same-size two- and four-objective experiments, AC-PC outperforms DCAN in all 16 two-objective comparisons and all 8 four-objective comparisons, with relative HV improvements of 10.26%–28.01% on the four-objective tasks. Transfer experiments on larger instances and public benchmarks further demonstrate the method's generalization ability, while component ablations and actor-parameter-matched comparisons help explain the sources of performance improvements. The authors also report cases where the method does not outperform the baselines, making the scope of the experimental conclusions reasonably clear. Overall, these results provide reasonably convincing support for the method's effectiveness and practical value.
Critical weaknesses
The submitted code omits parts of the multi-actor implementation, affecting the reproducibility of the experiments and making it more difficult to understand the full model implementation.
Questions for authors
-
In the scheduling illustration in Figure 1, operation starts before its predecessor has finished. Does this violate the job precedence constraints? Could the authors check and clarify this?
-
Could the authors provide a more detailed implementation, particularly for the multi-actor component, along with the corresponding configurations and instructions for running the code, to help readers understand the model implementation and reproduce the experimental results?
3 comments
I thank the authors for their rebuttal, which satisfactorily addresses the concerns raised in my review. I therefore remain my score.
At the same time, I recognize that my review may not fully capture the concerns highlighted by other reviewers. I would welcome their perspectives on whether the rebuttal adequately resolve these issues, and I remain open to revisiting my recommendation in light of the discussion.
Thank you for your follow-up
Dear Reviewer feAi,
Thank you for reviewing our response and for your support of our work. We are glad that our explanations address your concerns, and we appreciate your helpful comments and time throughout the review process.
Best regards, The Authors
Response on Figure 1 and the complete multi-actor implementation
Thank you for your positive assessment of our work and your helpful comments. References below refer to the revised manuscript.
Q1. Precedence in Figure 1 (Section 4). We have corrected the timing bars in Figure 1 so that O₂₂ starts at or after O₂₁ finishes. The scheduling environment enforces Sᵢⱼ=max(Cᵢ,ⱼ₋₁,Aₘ), using the predecessor's completion time and the machine's availability to determine each operation's start time.
W1/Q2. Implementation details. As stated in the Reproducibility statement, we will open-source the complete implementation immediately upon acceptance, including the multi-actor model, training/evaluation code, configurations, dependencies, and running instructions.
Section 4 describes the model: the shared encoder processes the scheduling state at each fixed preference anchor. Each actor has separate parameters and outputs action scores and hidden features. Preference-dependent weights combine these outputs; PC uses the mixed features and requested preference to refine each candidate's score before feasible-action masking and softmax. The encoder, actors and PC are trained jointly through the composed policy using PPO.