Lu Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Lu Chen has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Zhongkai Bao
Dingdong (Cayman) Limited, Shanghai, China
3 shared publications Kejun Qiu
2 shared publications- Kejun Qiu
School of Mechanical Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road, Minhang District, Shanghai 200240, China
2 shared publications - Stéphane Dauzère-Pérès
Mines Saint-Etienne, Univ Clermont Auvergne, CNRS, UMR 6158 LIMOS, Gardanne, France
2 shared publications Wenhui Yang
School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai, People's Republic of China
2 shared publications- André Langevin
Ecole Polytechnique de Montréal
1 shared publication
Latest Publications
- 19 February 2026
- Published by Springer Nature in Operational Research
- Vol. 26 (2) , 35
A branch-and-price algorithm for the last-mile delivery problem considering drivers’ experience
- 19 February 2026
- Published by Springer Nature in Operational Research
- Vol. 26 (2) , 35
A branch-and-price algorithm for the last-mile delivery problem considering drivers’ experience
- 4 July 2025
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 208
Ramp-up planning for aircraft assembly production considering learning effect
- 4 July 2025
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 208
Ramp-up planning for aircraft assembly production considering learning effect
- Open Access
A Sample Average Approximation Approach for Aircraft Product Configuration Optimization with Customer Order Uncertainty
Commercial aircraft manufacturers often face order uncertainty in particular situations, such as quantity or demand change, or lack of confirmed customer options. As a countermeasure, aircraft manufacturers can adopt a two-stage strategy to produce batch General-Configuration Aircraft (GCA), so as to maintain continuous aircraft production. Nevertheless, additional work on disassembling and re-assembling must be performed, to convert the GCA into specific configurations specified later by the customer. Thus, an appropriate GCA that leads to a minimal overall manufacturing workload is essential. In this paper, a Sample Average Approximation (SAA) model for GCA optimization is proposed, to obtain a robust GCA whose prediction results can help minimize the total production time. Compared with the empirical method, the proposed SAA approach significantly accelerates the production operation and is adaptive to various scenarios. The robustness of the SAA approach was evaluated, and the results prove that the general configuration obtained by the SAA approach has sustainable variances in the manufacturing workload.
Open AccessA Sample Average Approximation Approach for Aircraft Product Configuration Optimization with Customer Order Uncertainty
Commercial aircraft manufacturers often face order uncertainty in particular situations, such as quantity or demand change, or lack of confirmed customer options. As a countermeasure, aircraft manufacturers can adopt a two-stage strategy to produce batch General-Configuration Aircraft (GCA), so as to maintain continuous aircraft production. Nevertheless, additional work on disassembling and re-assembling must be performed, to convert the GCA into specific configurations specified later by the customer. Thus, an appropriate GCA that leads to a minimal overall manufacturing workload is essential. In this paper, a Sample Average Approximation (SAA) model for GCA optimization is proposed, to obtain a robust GCA whose prediction results can help minimize the total production time. Compared with the empirical method, the proposed SAA approach significantly accelerates the production operation and is adaptive to various scenarios. The robustness of the SAA approach was evaluated, and the results prove that the general configuration obtained by the SAA approach has sustainable variances in the manufacturing workload.
- 24 August 2024
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 31 (4) , 1-14
Unrelated Parallel-Machine Scheduling Problem with Time-Changing Effects and Dynamic Job Arrivals
- 24 August 2024
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 31 (4) , 1-14
Unrelated Parallel-Machine Scheduling Problem with Time-Changing Effects and Dynamic Job Arrivals
- 9 August 2024
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 31 (4) , 1-14
Lot-Sizing and Scheduling Problem Considering Fixture Resource Constraints: A Decomposition Solution Approach
- 9 August 2024
- Published by Springer Nature in Journal of Shanghai Jiaotong University (Science)
- Vol. 31 (4) , 1-14
Lot-Sizing and Scheduling Problem Considering Fixture Resource Constraints: A Decomposition Solution Approach
- 19 July 2023
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 70, 99-112
A surrogate-assisted heuristic approach for the joint optimization of resource allocation and scheduling of an aircraft final assembly line
- 19 July 2023
- Published by Elsevier in Journal of Manufacturing Systems
- Vol. 70, 99-112
A surrogate-assisted heuristic approach for the joint optimization of resource allocation and scheduling of an aircraft final assembly line
- 1 December 2021
- Published by Elsevier in Journal of Fuel Chemistry and Technology
- Vol. 49 (12) , 1802-1810
Characteristics of cyanobacteria pyrolysis and gasification during chemical looping process with red mud oxygen carrier
- 1 December 2021
- Published by Elsevier in Journal of Fuel Chemistry and Technology
- Vol. 49 (12) , 1802-1810
Characteristics of cyanobacteria pyrolysis and gasification during chemical looping process with red mud oxygen carrier
- 13 April 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (10) , 3047-3062
A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions
In modern production systems, considering machine conditions is becoming essential to achieving an overall optimisation of the production schedule. This paper studies a single machine scheduling problem, where the actual processing times of jobs depend on their position in the production sequence and maintenance is considered. Moreover, the machine is subject to an uncertain condition variation. There is a trade-off between rejecting a maintenance action, resulting in longer processing times, and accepting a maintenance action, leading to higher processing efficiency for future jobs. The problem is formulated as a finite-horizon Markov Decision Process. The objective is to minimise the makespan. Optimality properties are analysed, based on which a dynamic optimisation approach is developed. Computational experiments demonstrate the effectiveness of the proposed approach.
- 13 April 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (10) , 3047-3062
A dynamic optimisation approach for a single machine scheduling problem with machine conditions and maintenance decisions
In modern production systems, considering machine conditions is becoming essential to achieving an overall optimisation of the production schedule. This paper studies a single machine scheduling problem, where the actual processing times of jobs depend on their position in the production sequence and maintenance is considered. Moreover, the machine is subject to an uncertain condition variation. There is a trade-off between rejecting a maintenance action, resulting in longer processing times, and accepting a maintenance action, leading to higher processing efficiency for future jobs. The problem is formulated as a finite-horizon Markov Decision Process. The objective is to minimise the makespan. Optimality properties are analysed, based on which a dynamic optimisation approach is developed. Computational experiments demonstrate the effectiveness of the proposed approach.