Junwen Ding

Dr. Junwen Ding

orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
1 January 2021 in Computers & Operations Research
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
SSSven Schulz
Sven Schulz
LSLiji Shen
Liji Shen
UBUdo Buscher
Udo Buscher
ZLZhipeng Lü
Zhipeng Lü

1 March 2019 in Computers & Operations Research
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
LSLiji Shen
Liji Shen
ZLZhipeng Lü
Zhipeng Lü
BPBo Peng
Bo Peng

16 November 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
SDStéphane Dauzère-Pérès
Stéphane Dauzère-Pérès
LSLiji Shen
Liji Shen
ZLZhipeng Lü
Zhipeng Lü
Improving productivity at the expense of heavy energy consumption is often no longer possible in modern manufacturing industries. Through efficient scheduling technologies, however, we are able to still maintain high productivity while reducing energy costs. This paper addresses a flexible job shop scheduling problem under Time-Of-Use electricity tariffs with the objective of minimizing total energy consumption while considering a predefined makespan constraint. We propose a novel two-individual-based evolutionary (TIE) algorithm, which incorporates several distinguishing features such as a tabu search procedure, a topological order based recombination operator, a new neighborhood structure for this specific problem, and an approximate neighborhood evaluation method. Extensive experiments are conducted on widely used benchmark instances, which show that the proposed TIE outperforms traditional trajectory-based and population-based methods. We also analyze the key features of TIE to identify its critical success factors, and discuss the impact of varying key parameters of the problem to derive practical insights.

2 September 2019 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
LSLiji Shen
Liji Shen
ZLZhipeng Lu
Zhipeng Lu
LXLiping Xu
Liping Xu
UBUna Benlic
Una Benlic
This paper presents a hybrid memetic algorithm (HMA) for makespan minimization of parallel machine schedules with job deteriorating effects. The proposed HMA integrates two distinguished features - a novel compound neighborhood structure that extends the basic swap and insertion operators, as well as a divide-and-conquer based local search procedure. Unlike traditional local search methods, the divide-and-conquer based local search divides the original problem into subproblems so as to speed up the exploration of local optima. Experimental comparisons with the current state-of-the-art approaches show highly competitive performance of HMA in terms of both solution quality and computational efficiency. In particular, HMA obtains optimal solutions for all of the 900 small benchmark instances with an average computing time of 0.013 seconds and a success rate of 100%. Besides, it improves on the previous best-known results for 86 out of the 900 large benchmark instances, while matching the best-known results for the remaining cases. Additionally, we provide an analysis of the key algorithm features to identify its critical success factors.

7 April 2017 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
ZLZhipeng Lü
Zhipeng Lü
T.C. Edwin ChengT.C. Edwin Cheng
T.C. Edwin Cheng
LXLiping Xu
Liping Xu

1 August 2016 in Computers & Industrial Engineering
Verified
Journal Article
Closed access
JDJunwen Ding
Junwen Ding
ZLZhipeng Lü
Zhipeng Lü
T.C. Edwin ChengT.C. Edwin Cheng
T.C. Edwin Cheng
LXLiping Xu
Liping Xu