Liji Shen

Dr. Liji Shen


Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
23 May 2023 in European Journal of Operational Research
Verified
Journal Article
Open access
SDStéphane Dauzère-Pérès
Stéphane Dauzère-Pérès
JDJunwen Ding
Junwen Ding
LSLiji Shen
Liji Shen
KTKarim Tamssaouet
Karim Tamssaouet

5 April 2023 in European Journal of Operational Research
Verified
Journal Article
Closed access
LSLiji Shen
Liji Shen
SDStéphane Dauzère-Pérès
Stéphane Dauzère-Pérès
SMSöhnke Maecker
Söhnke Maecker

10 March 2020 in Journal of Business Economics
Verified
Journal Article
Open access
PDF file
SSSven Schulz
Sven Schulz
UBUdo Buscher
Udo Buscher
LSLiji Shen
Liji Shen
Energy costs play an important role in industrial production and are closely related to environmental concerns. As sustainability aspects are coming into focus in recent years, energy-oriented objectives are increasingly being taken into account in scheduling. At the same time, requirements for punctual delivery become more and more important in times of just-in-time delivery and highly networked supply chains. In this paper, a hybrid flow shop scheduling problem with variable discrete production speed levels is considered with the aim of minimizing both energy costs and total tardiness. Although lower speeds can reduce energy consumption, they also increase processing times, which counteract the objective of punctual delivery. Two new model formulations additionally taking time-of-use energy prices into account are presented and compared. The influence of variable discrete production speed levels on energy costs, energy consumption and punctual delivery as well as the interdependencies between these objectives are analysed in a numerical case study.

26 October 2020 in Computers & Operations Research
Verified
Journal Article
Closed access
LMLars Mönch
Lars Mönch
LSLiji Shen
Liji Shen

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.

22 May 2017 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
LSLiji Shen
Liji Shen
JGJatinder N. D. Gupta
Jatinder N. D. Gupta