Wanshuo Yang

Dr. Wanshuo Yang


Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 July 2023 in Journal of the Knowledge Economy
Verified
Journal Article
Closed access
PDF file
YTYingShuang Tan
YingShuang Tan
WYWanshuo Yang
Wanshuo Yang
Sid SuntrayuthSid Suntrayuth
Sid Suntrayuth
XYXin Yu
Xin Yu
Stavros SindakisStavros Sindakis
Stavros Sindakis
SSSaloome Showkat Shah
Saloome Showkat Shah

1 January 2024 in Journal of Industrial and Management Optimization
Verified
Journal Article
Closed access
PDF file
SHShanming Huang
Shanming Huang
FXFeng Xue
Feng Xue
WYWanshuo Yang
Wanshuo Yang
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.

4 July 2023 in Research Square
Verified
Preprint
Open access
PDF file
SHShanming Huang
Shanming Huang
WYWanshuo Yang
Wanshuo Yang
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.

27 December 2024 in Journal of the Knowledge Economy
Verified
Journal Article
Open access
PDF file
YTYingShuang Tan
YingShuang Tan
WYWanshuo Yang
Wanshuo Yang
Sid SuntrayuthSid Suntrayuth
Sid Suntrayuth
XYXin Yu
Xin Yu
Stavros SindakisStavros Sindakis
Stavros Sindakis
SSSaloome Showkat Shah
Saloome Showkat Shah