Haoxun Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Haoxun Chen has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
- Feng Chu
IBISC, Univ Evry, University of Paris-Saclay, Evry, France
8 shared publications - Lionel Amodeo
LOSI - Laboratoire d'Optimisation des Systèmes Industriels (12 rue Marie Curie, F-10010 Troyes - France)
5 shared publications - Karim Labadi
Laboratory LR2E, ECAM-EPMI/Quartz-Lab, 95092 Cergy-Pontoise, France
4 shared publications - Nengmin Wang
Xi’an Jiaotong University
4 shared publications - Duc Huy Nguyen
Faculty of Information Technology, Dong A University, Danang, Vietnam
3 shared publications - Bo Dai
Laboratoire d’optimisation des Systeme Industriels, Institut Charles Delaunay and UMR CNRS 6281, Universite de Technologie de Troyes, 12 Rue Marie Curie, CS 42060, 10004 Troyes CEDEX, France
2 shared publications
Latest Publications
- 17 May 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 224-237
Efficiency evaluation with common weights determined by lexicographical minimization of unsatisfaction degrees of decision-making units
- 17 May 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 336 (1) , 224-237
Efficiency evaluation with common weights determined by lexicographical minimization of unsatisfaction degrees of decision-making units
- 7 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 597-606
Cross-evaluation values and their applications to profit or cost allocation in collaborative logistics
- 7 April 2026
- Published by Elsevier in European Journal of Operational Research
- Vol. 335 (2) , 597-606
Cross-evaluation values and their applications to profit or cost allocation in collaborative logistics
- Open Access
- 2 February 2026
- Published by Elsevier in SSRN Electronic Journal
Logic-based Benders Decomposition Approach for a Human-Robot Collaborative Flow-Shop Scheduling Problem
In Industry 4.0, collaboration between robots and human workers in production systems has become a key strategy to enhance flexibility and efficiency. Traditional scheduling problems often fall short in capturing the complexity of modern workshops, as they typically consider only a single type of resource, either humans or robots. This paper addresses a NP-hard a human-robot collaborative flow-shop scheduling problem, which is characterized by strong interactions between human operators and robots operating in ten shifts each week. The problem involves multiple working shifts within a week, and the proposed model considers both the assignment of workers to shifts and the balancing of workload among them in order to prevent operator fatigue and ensure fair task allocation. The objective is to achieve efficient coordination between robots and human workers while preserving their well-being. A mixed-integer linear programming (MILP) formulation and a constraint programming (CP) formulation are introduced, together with two logic-based Benders decomposition (LBBD) methods combining with MILP and CP respectively. Computational experiments are conducted on 63 instances generated from the Taillard benchmarks with adaptation to a multi-shift flow-shop context. The results show that the MILP and CP models rapidly become intractable as the problem size increases, especially for large instances. By contrast, the proposed LBBD-CP approach can consistently find optimal or near-optimal solutions with smaller optimality gaps, and better scalability within a time limit of two hours in an ordinary personal computer.
- 2 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLogic-based Benders Decomposition Approach for a Human-Robot Collaborative Flow-Shop Scheduling Problem
In Industry 4.0, collaboration between robots and human workers in production systems has become a key strategy to enhance flexibility and efficiency. Traditional scheduling problems often fall short in capturing the complexity of modern workshops, as they typically consider only a single type of resource, either humans or robots. This paper addresses a NP-hard a human-robot collaborative flow-shop scheduling problem, which is characterized by strong interactions between human operators and robots operating in ten shifts each week. The problem involves multiple working shifts within a week, and the proposed model considers both the assignment of workers to shifts and the balancing of workload among them in order to prevent operator fatigue and ensure fair task allocation. The objective is to achieve efficient coordination between robots and human workers while preserving their well-being. A mixed-integer linear programming (MILP) formulation and a constraint programming (CP) formulation are introduced, together with two logic-based Benders decomposition (LBBD) methods combining with MILP and CP respectively. Computational experiments are conducted on 63 instances generated from the Taillard benchmarks with adaptation to a multi-shift flow-shop context. The results show that the MILP and CP models rapidly become intractable as the problem size increases, especially for large instances. By contrast, the proposed LBBD-CP approach can consistently find optimal or near-optimal solutions with smaller optimality gaps, and better scalability within a time limit of two hours in an ordinary personal computer.
- 24 April 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (2) , 207-219
Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry
- 24 April 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 326 (2) , 207-219
Two-dimensional cutting stock problem with flexible length and usable leftovers in the steel industry
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (11) , 16881-16896
Bi-Objective Vehicle Routing for Perishable Products Delivery With Consideration of Customers’ Priorities and Customized Delivery Time Windows
As fresh product e-commerce experiences exponential expansion, the delivery of fresh products which are perishable is becoming a large part of road freight transportation. Transporting perishable products is a challenging task as it is difficult to preserve their nutritional value and freshness. To keep the freshness of such products in delivery, efficient transportation is critical. Besides, customers nowadays attach more importance to service flexibility, which contributes to customer satisfaction and is highly valued by suppliers. However, the service flexibility was seldom addressed previously in the delivery of fresh products. In this paper, we study a vehicle routing problem faced by a supplier who delivers perishable products to customers. We consider the service flexibility of the supplier who offers different delivery modes associated with differentiated time windows to customers. The supplier aims to maximize both its profit and customer satisfaction, where the customer satisfaction is measured by the weighted average quality loss of perishable products during delivery. This bi-objective vehicle routing problem with different customer priorities and delivery time windows is structured as a bi-objective mixed-integer linear programming model. To obtain the Pareto frontier of the model, an adaptive large neighborhood search (ALNS) algorithm based on the $\varepsilon$ -constraint method and a multi-objective ALNS algorithm are developed with several improvement strategies proposed. The computational results conducted on modified Solomon’s instances validate the model and prove the efficiency of the algorithms. Sensitivity analysis of the problem and the algorithms provide some managerial insights.
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (11) , 16881-16896
Bi-Objective Vehicle Routing for Perishable Products Delivery With Consideration of Customers’ Priorities and Customized Delivery Time Windows
As fresh product e-commerce experiences exponential expansion, the delivery of fresh products which are perishable is becoming a large part of road freight transportation. Transporting perishable products is a challenging task as it is difficult to preserve their nutritional value and freshness. To keep the freshness of such products in delivery, efficient transportation is critical. Besides, customers nowadays attach more importance to service flexibility, which contributes to customer satisfaction and is highly valued by suppliers. However, the service flexibility was seldom addressed previously in the delivery of fresh products. In this paper, we study a vehicle routing problem faced by a supplier who delivers perishable products to customers. We consider the service flexibility of the supplier who offers different delivery modes associated with differentiated time windows to customers. The supplier aims to maximize both its profit and customer satisfaction, where the customer satisfaction is measured by the weighted average quality loss of perishable products during delivery. This bi-objective vehicle routing problem with different customer priorities and delivery time windows is structured as a bi-objective mixed-integer linear programming model. To obtain the Pareto frontier of the model, an adaptive large neighborhood search (ALNS) algorithm based on the $\varepsilon$ -constraint method and a multi-objective ALNS algorithm are developed with several improvement strategies proposed. The computational results conducted on modified Solomon’s instances validate the model and prove the efficiency of the algorithms. Sensitivity analysis of the problem and the algorithms provide some managerial insights.
- 2 November 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (1-2) , 556-573
A decomposition and coordination method for optimising ( Q , S ) policies in a two-echelon distribution system with joint replenishment
- 2 November 2023
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 62 (1-2) , 556-573
A decomposition and coordination method for optimising ( Q , S ) policies in a two-echelon distribution system with joint replenishment
- 14 September 2023
- Published by Springer Nature
- p. 257-270
Cost Evaluation of a (Q, r, K) Inventory Model with Two Demand Classes of Lost Sales and Backorders
- 14 September 2023
- Published by Springer Nature
- p. 257-270
Cost Evaluation of a (Q, r, K) Inventory Model with Two Demand Classes of Lost Sales and Backorders