Jianlu Zheng

Mr. Jianlu Zheng


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
31 January 2025 in Processes
Verified
Journal Article
Open access
PDF file
HXHua Xu
Hua Xu
JZJianlu Zheng
Jianlu Zheng
LHLingxiang Huang
Lingxiang Huang
JTJuntai Tao
Juntai Tao
CZChenjie Zhang
Chenjie Zhang
Economic performance in modern manufacturing enterprises is often influenced by random dynamic events, requiring real-time scheduling to manage multiple conflicting production objectives simultaneously. However, traditional scheduling methods often fall short due to their limited responsiveness in dynamic environments. To address this challenge, this paper proposes an innovative online rescheduling framework called the Dual-Level Integrated Deep Q-Network (DLIDQN). This framework is designed to solve the dynamic multi-objective flexible job shop scheduling problem (DMOFJSP), which is affected by six types of dynamic events: new job insertion, job operation modification, job deletion, machine addition, machine tool replacement, and machine breakdown. The optimization focuses on three key objectives: minimizing makespan, maximizing average machine utilization (Uave), and minimizing average job tardiness rate (TRave). The DLIDQN framework leverages a hierarchical reinforcement learning approach and consists of two integrated IDQN-based agents. The high-level IDQN serves as the decision-maker during rescheduling, implementing dual-level decision-making by dynamically selecting optimization objectives based on the current system state and guiding the low-level IDQN’s actions. To meet diverse optimization requirements, two reward mechanisms are designed, focusing on job tardiness and machine utilization, respectively. The low-level IDQN acts as the executor, selecting the best scheduling rules to achieve the optimization goals determined by the high-level agent. To improve scheduling adaptability, nine composite scheduling rules are introduced, enabling the low-level IDQN to flexibly choose strategies for job sequencing and machine assignment, effectively addressing both sub-tasks to achieve optimal scheduling performance. Additionally, a local search algorithm is incorporated to further enhance efficiency by optimizing idle time between jobs. The numerical experimental results show that in 27 test scenarios, the DLIDQN framework consistently outperforms all proposed composite scheduling rules in terms of makespan, surpasses the widely used single scheduling rules in 26 instances, and always exceeds other reinforcement learning-based methods. Regarding the Uave metric, the framework demonstrates superiority in 21 instances over all composite scheduling rules and maintains a consistent advantage over single scheduling rules and other RL-based strategies. For the TRave metric, DLIDQN outperforms composite and single scheduling rules in 20 instances and surpasses other RL-based methods in 25 instances. Specifically, compared to the baseline methods, our model achieves maximum performance improvements of approximately 37%, 34%, and 30% for the three objectives, respectively. These results validate the robustness and adaptability of the proposed framework in dynamic manufacturing environments and highlight its significant potential to enhance scheduling efficiency and economic benefits.

3 January 2025 in Processes
Verified
Journal Article
Open access
PDF file
HXHua Xu
Hua Xu
JTJuntai Tao
Juntai Tao
LHLingxiang Huang
Lingxiang Huang
CZChenjie Zhang
Chenjie Zhang
JZJianlu Zheng
Jianlu Zheng
With the rapid advancement of the manufacturing industry and the widespread implementation of intelligent manufacturing systems, the energy-aware distributed heterogeneous flexible job shop scheduling problem (DHFJSP) has emerged as a critical challenge in optimizing modern production systems. This study introduces an innovative method to reduce both the makespan and the total energy consumption (TEC) in the context of the DHFJSP. A deep reinforcement advantage Actor-Critic-based co-evolution algorithm (DRAACCE) is proposed to address the issue, which leverages the powerful decision-making and perception abilities of the advantage Actor-Critic (AAC) method. The DRAACCE algorithm consists of three main components: First, to ensure a balance between global and local search capabilities, we propose a new co-evolutionary strategy. This enables the algorithm to explore the solution space efficiently while maintaining robust exploration and exploitation. Next, a novel evolution strategy is introduced to improve the algorithm’s convergence rate and solution diversity, ensuring that the search process is both fast and effective. Finally, we integrate deep reinforcement learning with the advantage Actor-Critic framework to select elite solutions, enhancing the optimization process and leading to superior performance in minimizing both TEC and makespan. Extensive experiments validate the effectiveness of the proposed DRAACCE algorithm. The experimental results show that DRAACCE significantly outperforms existing state-of-the-art methods on all 20 instances and a real-world case, achieving better solutions in terms of both makespan and TEC.

3 March 2025 in Processes
Verified
Journal Article
Open access
PDF file
HXHua Xu
Hua Xu
LHLingxiang Huang
Lingxiang Huang
JTJuntai Tao
Juntai Tao
CZChenjie Zhang
Chenjie Zhang
JZJianlu Zheng
Jianlu Zheng
Due to increasing energy consumption, green scheduling in the manufacturing industry has attracted great attention. In distributed manufacturing involving heterogeneous plants, accounting for complex work sequences and energy consumption poses a major challenge. To address distributed heterogeneous green hybrid flowshop scheduling (DHGHFSP) while optimising total weighted delay (TWD) and total energy consumption (TEC), a deep reinforcement learning-based evolutionary algorithm (DRLBEA) is proposed in this article. In the DRLBEA, a problem-based hybrid heuristic initialization with random-sized population is designed to generate a desirable initial solution. A bi-population evolutionary algorithm with global search and local search is used to obtain the elite archive. Moreover, a distributional Deep Q-Network (DQN) is trained to select the best local search strategy. Experimental results on 20 instances show a 9.8% increase in HV mean value and a 35.6% increase in IGD mean value over the state-of-the-art method. The results show the effectiveness and efficiency of the DRLBEA in solving DHGHFSP.

4 March 2025 in Processes
Verified
Journal Article
Open access
PDF file
HXHua Xu
Hua Xu
CZChenjie Zhang
Chenjie Zhang
LHLingxiang Huang
Lingxiang Huang
JTJuntai Tao
Juntai Tao
JZJianlu Zheng
Jianlu Zheng
Dynamic multi-objective optimization problems (DMOPs) are widely encountered in engineering optimization processes, characterized by conflicting objectives that change over time. Evolutionary transfer optimization (ETO) has recently emerged as a promising optimization paradigm for addressing DMOPs. ETO-based dynamic multi-objective evolutionary algorithms (DMOEAs) usually adopt discriminative prediction strategies to select high-quality initial solutions in new environments by transferring knowledge from the source domain, thereby accelerating the evolutionary process. However, DMOPs often change in both decision and objective spaces. Existing methods rely on a single view from the source domain for knowledge transfer, which can overlook crucial knowledge from other views, potentially affecting the selection of high-quality initial solutions and limiting optimization performance. To address this, we propose a discriminative prediction strategy based on multi-view knowledge transfer for DMOEA, called MKT-DMOEA. Specifically, we construct discriminative predictors from the view of the decision space and objective space in the source domain. Each discriminative predictor effectively reduces the differences between environments under the current view through a transfer strategy based on geometric feature transformation. Meanwhile, these predictors make full use of the transferred knowledge to achieve accurate discriminative predictions under the current view. Finally, we integrate the discriminative prediction results from multiple views to select high-quality initial solutions. Experimental results demonstrate that our proposed algorithm outperforms four other state-of-the-art DMOEAs in terms of both diversity and convergence on the well-known CEC 2018 dynamic multi-objective optimization benchmark suite DF.

23 March 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
HXHua Xu
Hua Xu
LHLingxiang Huang
Lingxiang Huang
JTJuntai Tao
Juntai Tao
CZChenjie Zhang
Chenjie Zhang
JZJianlu Zheng
Jianlu Zheng
Distributed heterogeneous hybrid flow shop scheduling with job deadlines and priorities (DHHFSP-JDP) is a combination of scheduling problem and distributionary environment. Addressing complex work sequences and energy consumption in distributed manufacturing with heterogeneous plants is a major challenge. It is necessary for optimizing total weighted delay (TWD) and total energy consumption (TEC) in distributed heterogeneous green hybrid flowshops. A model using mixed integer linear programming is applied to describe DHGHFSP-JDP and a decomposition-based coevolutionary algorithm (DBCEA) is considered to be the solution in this article. In this approach, (1) a decomposition-based heuristic initialization is proposed, in which an initialization strategy with a randomly sized population is adopted to establish effective initial schedules. (2) elite selection strategy based on the integration of an external archive and an elite archive. (3) four problem-based operator selection strategies embedded in a cooperative local search framework, and an Upper Confidence Bound (UCB) mechanism to design a strategy for selecting local search operators. In the end, The superiority of DBCEA is validated through comparative experiments against several advanced algorithms across 20 benchmarks, with results showing it often provides the best Pareto solution set.