Junjie Zhang

Dr. Junjie Zhang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 April 2025 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
YCYarong Chen
Yarong Chen
JZJunjie Zhang
Junjie Zhang
JMJabir Mumtaz
Jabir Mumtaz
SHShenquan Huang
Shenquan Huang
SZShengwei Zhou
Shengwei Zhou

24 September 2024 in Engineering Proceedings
Verified
Conference Paper
Open access
PDF file
JZJunjie Zhang
Junjie Zhang
YCYarong Chen
Yarong Chen
JMJabir Mumtaz
Jabir Mumtaz
This paper introduces the Improved Evolution Strategy Reinforcement Learning (I-ES) algorithm. The I-ES algorithm is designed to minimize the makespan and total energy consumption (TEC) in a multi-objective dynamic scheduling problem within a hybrid flow shop. It addresses key challenges such as flexible preventive maintenance for machines, random job arrivals, uncertain processing times, and the setup time. An experimental comparison of the I-ES-based approach with Evolution Strategy Reinforcement Learning (ES) algorithms and scheduling rules, which are a combination of job selection rules and machine selection rules, has been carried out by designing problem examples. The Generational Distance (GD) and Inverted Generational Distance (IGD) metrics of the I-ES algorithm are obtained by averaging all the instances as 389.14 and 1476.25, respectively, which are smaller than the other compared algorithms, so the results show that the I-ES algorithm can obtain solutions with superior convergence compared to that of the ES algorithm and dispatching rules.

11 September 2023 in Engineering Proceedings
Verified
Conference Paper
Open access
PDF file
JZJunjie Zhang
Junjie Zhang
YCYarong Chen
Yarong Chen
JMJabir Mumtaz
Jabir Mumtaz
SZShengwei Zhou
Shengwei Zhou
In this paper, the Neuro-Evolution of Augmenting Topologies (NEAT) algorithm is proposed to minimize the maximum completion time in a dynamic scheduling problem of hybrid flow shops. In hybrid flow shops, machines require flexible preventive maintenance and jobs arrive randomly with uncertain processing times. The NEAT-based approach is experimentally compared with the SPT and FIFO scheduling rules by designing problem instances. The results show that the NEAT-based scheduling method can obtain solutions with better convergence while responding quickly compared to the scheduling rules.