Lirui Xue
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
Lirui Xue has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Shinan Zhao
School of Economics and Management, Jiangsu University of Science and Technology
2 shared publications - Amin Mahmoudi
Department of Construction and Real Estate, School of Civil Engineering, Southeast University, Nanjing, China
1 shared publication - Bismark Appiah Addae
College of Economics and Management, Nanjing University of Aeronautics and Astronautics, Nanjing, People’s Republic of China
1 shared publication - Daao Wang
School of Management Science and Engineering, Nanjing University of Finance and Economics, Nanjing, China
1 shared publication - Jun Wu
School of Economics and Management, Jiangsu University of Science and Technology
1 shared publication - Mohammad Reza Feylizadeh
Department of Industrial Engineering, Shiraz Branch, Islamic Azad University, Shiraz, Iran
1 shared publication
Latest Publications
- Open Access
- 28 October 2026
- Published by Springer Nature in Complex & Intelligent Systems
Super conflict grey target negotiation consensus approach with limited compromises and tolerance behaviors
- 28 October 2026
- Published by Springer Nature in Complex & Intelligent Systems
Open AccessSuper conflict grey target negotiation consensus approach with limited compromises and tolerance behaviors
- Open Access
- 2 March 2024
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 10 (3) , 4083-4101
Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm
The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems. Despite their wide application and prevalence in practical production, it seems that current research on these types of combinatorial optimization problems remains limited and uninvestigated. More specifically, existing research mainly concentrates on the flow shop scenarios in parallel batch machines for job shop scheduling but few literature emphasis on the flexible job shop integration in these contexts. To directly address the above mentioned problems, this paper establishes an optimization model considering parallel batch processing machines, aiming to minimize the maximum completion time in operating and production environments. The proposed solution merges variable neighborhood search with multi-population genetic algorithms, conducting a neighborhood search on the elite population to reduce the likelihood of falling into local optima. Subsequently, its applicability was evaluated in computational experiments using real production scenarios from a partnering enterprise and extended datasets. The findings from the analyses indicate that the enhanced algorithm can decrease the objective value by as much as 15% compared to other standard algorithms. Importantly, the proposed approach effectively resolves flexible job shop scheduling problems involving parallel batch processing machines. The contribution of the research is providing substantial theoretical support for enterprise production scheduling.
- 2 March 2024
- Published by Springer Nature in Complex & Intelligent Systems
- Vol. 10 (3) , 4083-4101
Open AccessFlexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm
The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems. Despite their wide application and prevalence in practical production, it seems that current research on these types of combinatorial optimization problems remains limited and uninvestigated. More specifically, existing research mainly concentrates on the flow shop scenarios in parallel batch machines for job shop scheduling but few literature emphasis on the flexible job shop integration in these contexts. To directly address the above mentioned problems, this paper establishes an optimization model considering parallel batch processing machines, aiming to minimize the maximum completion time in operating and production environments. The proposed solution merges variable neighborhood search with multi-population genetic algorithms, conducting a neighborhood search on the elite population to reduce the likelihood of falling into local optima. Subsequently, its applicability was evaluated in computational experiments using real production scenarios from a partnering enterprise and extended datasets. The findings from the analyses indicate that the enhanced algorithm can decrease the objective value by as much as 15% compared to other standard algorithms. Importantly, the proposed approach effectively resolves flexible job shop scheduling problems involving parallel batch processing machines. The contribution of the research is providing substantial theoretical support for enterprise production scheduling.
- Open Access
Strategic Analyses for a Cross-Basin Water Pollution Conflict Involving Heterogeneous Sanctions in Hongze Lake, China, within the GMCR Paradigm
The graph model for conflict resolution (GMCR) methodology was enhanced in this research for addressing cross-basin water pollution conflicts involving heterogeneous sanctions, as a more intuitive and straightforward definition for mixed unilateral improvements was proposed, followed by an integrated procedure for performing mixed stability analyses. Furthermore, the cross-border water pollution dispute that occurred in 2018 in Hongze Lake, China, is systematically modeled and strategically analyzed for the first time, using the improved GMCR method. In addition, an evolution analysis was carried out within the framework of GMCR for verifying the applicability of the eco-compensation mechanism in addressing cross-basin water pollution disputes. This case study demonstrates that the heterogeneity of sanctioning opponents could influence equilibrium outcomes and even change the evolution of conflict situations. Moreover, the developed novel approach is able to accurately predict the equilibrium outcomes of the conflict and provide more strategic insights and valuable findings in making effective conflict resolutions for solving cross-basin water pollution conflicts.
Open AccessStrategic Analyses for a Cross-Basin Water Pollution Conflict Involving Heterogeneous Sanctions in Hongze Lake, China, within the GMCR Paradigm
The graph model for conflict resolution (GMCR) methodology was enhanced in this research for addressing cross-basin water pollution conflicts involving heterogeneous sanctions, as a more intuitive and straightforward definition for mixed unilateral improvements was proposed, followed by an integrated procedure for performing mixed stability analyses. Furthermore, the cross-border water pollution dispute that occurred in 2018 in Hongze Lake, China, is systematically modeled and strategically analyzed for the first time, using the improved GMCR method. In addition, an evolution analysis was carried out within the framework of GMCR for verifying the applicability of the eco-compensation mechanism in addressing cross-basin water pollution disputes. This case study demonstrates that the heterogeneity of sanctioning opponents could influence equilibrium outcomes and even change the evolution of conflict situations. Moreover, the developed novel approach is able to accurately predict the equilibrium outcomes of the conflict and provide more strategic insights and valuable findings in making effective conflict resolutions for solving cross-basin water pollution conflicts.