Wanshuo Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wanshuo Yang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Saloome Showkat
American University in the Emirates College of Business Administration Dubai
2 shared publications - Sid Suntrayuth
International College, National Institute of Development Administration, Bangkok, Thailand
2 shared publications - Stavros Sindakis
National Research Base of Intelligent Manufacturing Service, Chongqing Technology and Business University, Chongqing, China
2 shared publications - Xin Yu
International College, National Institute of Development Administration, Bangkok, Thailand
2 shared publications - YingShuang Tan
College of Mathematics and Statistics, Chongqing University, Chongqing, China
2 shared publications - Feng Xue
Univ Elect Sci & Technol China, Sch Management & Econ, Chengdu 611731, Peoples R China
1 shared publication
Latest Publications
- RetractionOpen Access
- 27 December 2024
- Published by Springer Nature in Journal of the Knowledge Economy
- Vol. 16 (S1) , 11-12
Retraction Note: Optimizing Stock Portfolio Performance with a Combined RG1-TOPSIS Model: Insights from the Chinese Market
- 27 December 2024
- Published by Springer Nature in Journal of the Knowledge Economy
- Vol. 16 (S1) , 11-12
RetractionOpen AccessRetraction Note: Optimizing Stock Portfolio Performance with a Combined RG1-TOPSIS Model: Insights from the Chinese Market
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (1) , 368-391
Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
Our investigation into the production substitution between products is motivated by a significant issue faced by firms in practice: the effective balance of setup and substitution cost. Given that firms can adjust an operation policy to lower the setup and substitution costs or both, the operation manager should also know how best to make the adjustment. Thus, in this study, we consider a class of dynamic lot sizing problems with one-way and two-way product substitution modes under durable and perishable products. According to some structural properties in an optimal solution, we devise a forward dynamic programming (DP) algorithm to work out the problem with two durable products in a polynomial time. Then, we develop an efficient approximate DP algorithm to solve the problem with multiple perishable products. Finally, on a comprehensive test bed, we gain some useful insights on the impact of substitution on the total costs. We also tested the effectiveness of the approximate algorithm.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 20 (1) , 368-391
Efficient approximate algorithms for a class of dynamic lot size problems under product substitution
Our investigation into the production substitution between products is motivated by a significant issue faced by firms in practice: the effective balance of setup and substitution cost. Given that firms can adjust an operation policy to lower the setup and substitution costs or both, the operation manager should also know how best to make the adjustment. Thus, in this study, we consider a class of dynamic lot sizing problems with one-way and two-way product substitution modes under durable and perishable products. According to some structural properties in an optimal solution, we devise a forward dynamic programming (DP) algorithm to work out the problem with two durable products in a polynomial time. Then, we develop an efficient approximate DP algorithm to solve the problem with multiple perishable products. Finally, on a comprehensive test bed, we gain some useful insights on the impact of substitution on the total costs. We also tested the effectiveness of the approximate algorithm.
- Retracted
- 17 July 2023
- Published by Springer Nature in Journal of the Knowledge Economy
- Vol. 15 (2) , 9029-9052
RETRACTED ARTICLE: Optimizing Stock Portfolio Performance with a Combined RG1-TOPSIS Model: Insights from the Chinese Market
- 17 July 2023
- Published by Springer Nature in Journal of the Knowledge Economy
- Vol. 15 (2) , 9029-9052
RetractedRETRACTED ARTICLE: Optimizing Stock Portfolio Performance with a Combined RG1-TOPSIS Model: Insights from the Chinese Market
- Open Access
- 4 July 2023
- Published by Springer Nature in Research Square
Efficient approximate algorithms for a class of dynamic lot size problem under product substitution
Our motivation to study the production substitution between the products come from the firms’ practice. A significant issue to the firms is the effective balance of setup and substitution cost. Since the firms can adjust the operation policy to lower the setup and substitution costs or both, the operation manager would like to know how best to make the adjustment. Given this, we consider a class of dynamic lot sizing problems with one-way and two-way product substitution under durable and perishable products. According to some structural properties in an optimal solution, we devise a forward dynamic programming algorithm to work out the problem with two durable products in polynomial time, and develop an efficient approximate dynamic programming algorithm to solve the problem with multiple perishable products. Finally, on a comprehensive test bed, we gain some useful insights on the impact of substitution on the total costs. The effectiveness of the approximate algorithm is also tested.
- 4 July 2023
- Published by Springer Nature in Research Square
Open AccessEfficient approximate algorithms for a class of dynamic lot size problem under product substitution
Our motivation to study the production substitution between the products come from the firms’ practice. A significant issue to the firms is the effective balance of setup and substitution cost. Since the firms can adjust the operation policy to lower the setup and substitution costs or both, the operation manager would like to know how best to make the adjustment. Given this, we consider a class of dynamic lot sizing problems with one-way and two-way product substitution under durable and perishable products. According to some structural properties in an optimal solution, we devise a forward dynamic programming algorithm to work out the problem with two durable products in polynomial time, and develop an efficient approximate dynamic programming algorithm to solve the problem with multiple perishable products. Finally, on a comprehensive test bed, we gain some useful insights on the impact of substitution on the total costs. The effectiveness of the approximate algorithm is also tested.