Shaohui Xi
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
Shaohui Xi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
Huiyu Zhang
School of Electromechanical Engineering, Guangdong University of Technology, Guangzhou, China
2 shared publications- James MacGregor Smith
University of Massachusetts
2 shared publications - Ning Mao
Aerospace Information Research Institute, Chinese Academy of Sciences, Beijing 100190, China
2 shared publications - Qingxin Chen
School of Electromechanical Engineering, Guangdong University of Technology, Guangzhou, People’s Republic of China
2 shared publications Ailin Yu
School of Electromechanical Engineering, Guangdong University of Technology, Guangzhou, People’s Republic of China
1 shared publication- Ailin Yu
State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment, Guangdong University of Technology, Guangzhou 510006, China
1 shared publication
Latest Publications
- Open Access
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 101320-101338
Joint Machine Selection and Buffer Allocation in Large Split and Merge Manufacturing Systems
This study focuses on the simultaneous optimization of machines and buffers in split and merge production systems. The objective was to minimize the total investment cost under a minimum throughput rate and maximum cycle time constraints. It is challenging to solve this type of stochastic resource allocation problem due to the phenomenon of the combinatorial explosion search space and the inability to obtain closed-form expressions for the optimization model. In this paper, a decomposition-coordination method (DCM) is proposed to optimize the machine types used, the number of machines, and the capacities of buffers of general feed-forward topology systems efficiently and accurately. Instead of directly targeting large-scale systems, the DCM decomposes the original system into several small decoupled systems with added coordination variables and then separately optimizes each decomposed system. An optimal or near-optimal solution is obtained after several iterations of the decoupled system optimization and coordination variable updating. Moreover, we develop a simulated annealing algorithm and non-dominated sorting genetic algorithm-II as benchmark algorithms and provide a parameter calibration analysis of the two metaheuristics. Finally, comprehensive numerical experiments are performed to demonstrate the performances of the DCM, and a multifactorial experimental analysis is conducted to determine the influence of the split and merge system parameters on the performances of the DCM. The results confirmed that the scale of the system, complexity of topology, cycle time constraint, traffic intensity, price ratio, and their interactions significantly influenced the total cost obtained from the DCM, whereas the scale of the system, traffic intensity, and price ratio significantly affected the computation time.
- 11 September 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 101320-101338
Open AccessJoint Machine Selection and Buffer Allocation in Large Split and Merge Manufacturing Systems
This study focuses on the simultaneous optimization of machines and buffers in split and merge production systems. The objective was to minimize the total investment cost under a minimum throughput rate and maximum cycle time constraints. It is challenging to solve this type of stochastic resource allocation problem due to the phenomenon of the combinatorial explosion search space and the inability to obtain closed-form expressions for the optimization model. In this paper, a decomposition-coordination method (DCM) is proposed to optimize the machine types used, the number of machines, and the capacities of buffers of general feed-forward topology systems efficiently and accurately. Instead of directly targeting large-scale systems, the DCM decomposes the original system into several small decoupled systems with added coordination variables and then separately optimizes each decomposed system. An optimal or near-optimal solution is obtained after several iterations of the decoupled system optimization and coordination variable updating. Moreover, we develop a simulated annealing algorithm and non-dominated sorting genetic algorithm-II as benchmark algorithms and provide a parameter calibration analysis of the two metaheuristics. Finally, comprehensive numerical experiments are performed to demonstrate the performances of the DCM, and a multifactorial experimental analysis is conducted to determine the influence of the split and merge system parameters on the performances of the DCM. The results confirmed that the scale of the system, complexity of topology, cycle time constraint, traffic intensity, price ratio, and their interactions significantly influenced the total cost obtained from the DCM, whereas the scale of the system, traffic intensity, and price ratio significantly affected the computation time.
- 1 March 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (7) , 2103-2125
Simultaneous machine selection and buffer allocation in large unbalanced series-parallel production lines
Simultaneous optimisation of machines and buffers in a large series-parallel production line is an NP-hard problem. The formulated optimisation model in this study is used to minimise the total investment cost subject to the desired throughput rate and cycle time by optimising the machine types, number of parallel machines, and buffer capacities. To solve this kind of design problem, a decomposition-coordination method is proposed to efficiently and accurately generate allocation solutions for large production lines. The proposed method includes two iterative processes: the decomposition process decouples the original line into several small lines and optimises them separately, while the coordination process ensures that the optimisation problems of the decomposed lines are similar to the corresponding part of the original. The performance of this approach is demonstrated through numerical experiments by comparisons with the simulated annealing algorithm and non-dominated sorting genetic algorithm-II. Finally, the sets of numerical results and a multi-factorial experimental analysis illustrate the influences of target system parameters on the resource configurations.
- 1 March 2021
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 60 (7) , 2103-2125
Simultaneous machine selection and buffer allocation in large unbalanced series-parallel production lines
Simultaneous optimisation of machines and buffers in a large series-parallel production line is an NP-hard problem. The formulated optimisation model in this study is used to minimise the total investment cost subject to the desired throughput rate and cycle time by optimising the machine types, number of parallel machines, and buffer capacities. To solve this kind of design problem, a decomposition-coordination method is proposed to efficiently and accurately generate allocation solutions for large production lines. The proposed method includes two iterative processes: the decomposition process decouples the original line into several small lines and optimises them separately, while the coordination process ensures that the optimisation problems of the decomposed lines are similar to the corresponding part of the original. The performance of this approach is demonstrated through numerical experiments by comparisons with the simulated annealing algorithm and non-dominated sorting genetic algorithm-II. Finally, the sets of numerical results and a multi-factorial experimental analysis illustrate the influences of target system parameters on the resource configurations.
- 4 November 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (22) , 6846-6867
A new method for solving buffer allocation problem in large unbalanced production lines
Solving the buffer allocation problem (BAP) in long production lines is difficult because it is an NP-hard problem. In this paper, we propose a new approach to solve the BAP for long series-parallel unbalanced production lines with the objective of minimising the average work-in-process subject to a throughput rate constraint. Instead of directly optimising a long line, this method decomposes the original long line into several small decoupled subsystems and adds relation condition variables between the subsystems. After several iterations between subsystem optimisation and condition updating, this method can obtain the optimal or near-optimal solution of the original system with a significantly improved computational efficiency. Extensive numerical experiments demonstrate the accuracy and efficiency of this approach. Finally, several examples and a multi-factorial experimental analysis are provided to show the influence of the decomposition strategy, initial values, and parameters of the target systems on the performance of the proposed method.
- 4 November 2019
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 58 (22) , 6846-6867
A new method for solving buffer allocation problem in large unbalanced production lines
Solving the buffer allocation problem (BAP) in long production lines is difficult because it is an NP-hard problem. In this paper, we propose a new approach to solve the BAP for long series-parallel unbalanced production lines with the objective of minimising the average work-in-process subject to a throughput rate constraint. Instead of directly optimising a long line, this method decomposes the original long line into several small decoupled subsystems and adds relation condition variables between the subsystems. After several iterations between subsystem optimisation and condition updating, this method can obtain the optimal or near-optimal solution of the original system with a significantly improved computational efficiency. Extensive numerical experiments demonstrate the accuracy and efficiency of this approach. Finally, several examples and a multi-factorial experimental analysis are provided to show the influence of the decomposition strategy, initial values, and parameters of the target systems on the performance of the proposed method.