Optimization of the seru production system with demand fluctuation: A Mean-CVaR model

被引:1
|
作者
Tao, Liangyan [1 ]
Tao, Rui [1 ]
Xie, Naiming [1 ]
机构
[1] Nanjing Univ Aeronaut & Astronaut, Coll Econ & Management, Nanjing 211106, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Seru production system (SPS); Mean-CVaR model; Multi-objective optimization; CONVERSION; ALGORITHM;
D O I
10.1016/j.cie.2024.110760
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
The increasingly diverse and non-deterministic customer demands have given rise to the seru production system. This study aims to address the multi-objective seru formation problem under demand fluctuations, with the mean and the CVaR or standard deviation of total completion time minimized. In particular, two multi-objective stochastic optimization models, i.e., Mean-CVaR and Mean-Std, are constructed to determine the number of seru, the allocation scheme of workers and batches. Then, the Local Search Fast Non-dominated Sorting Genetic Algorithm (NSGA-II-LS) is designed to solve the proposed models. Numerical experiments validate the method's effectiveness by demonstrating that, compared to the Mean-Std model, the Mean-CVaR model enhances the seru system's capability and stability in coping with stochastic demand fluctuations through an average reduction of 4% in expected value and an average reduction of 36% in standard deviation. The effects of confidence level, the product batch number, and the standard deviation on the results have been analyzed. The results show that the Mean-CVaR method helps achieve a more stable seru system in terms of reducing standard deviation. Moreover, product batch division is beneficial to the CVaR of total processing time but detrimental to the mean processing time.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] Asymptotic behavior of Mean-CVaR portfolio selection model under nonparametric framework
    ZHAO Jun
    ZHANG Yi
    AppliedMathematics:AJournalofChineseUniversities, 2017, 32 (01) : 79 - 92
  • [22] Asymptotic behavior of Mean-CVaR portfolio selection model under nonparametric framework
    Jun Zhao
    Yi Zhang
    Applied Mathematics-A Journal of Chinese Universities, 2017, 32 : 79 - 92
  • [23] Asymptotic behavior of Mean-CVaR portfolio selection model under nonparametric framework
    Zhao, Jun
    Zhang, Yi
    APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2017, 32 (01) : 79 - 92
  • [24] Black-Litterman model with copula-based views in mean-CVaR portfolio optimization framework with weight constraints
    Teplova, Tamara
    Evgeniia, Mikova
    Munir, Qaiser
    Pivnitskaya, Nataliya
    ECONOMIC CHANGE AND RESTRUCTURING, 2023, 56 (01) : 515 - 535
  • [25] Uncertain mean-CVaR model for portfolio selection with transaction cost and investors' preferences
    Wang, Xiantao
    Zhu, Yuanguo
    Tang, Pan
    NORTH AMERICAN JOURNAL OF ECONOMICS AND FINANCE, 2024, 69
  • [26] Black-Litterman model with copula-based views in mean-CVaR portfolio optimization framework with weight constraints
    Tamara Teplova
    Mikova Evgeniia
    Qaiser Munir
    Nataliya Pivnitskaya
    Economic Change and Restructuring, 2023, 56 : 515 - 535
  • [27] Research on Supply Chain Price-only Contract Based on Mean-CVaR Model
    Qiang, Mai
    Yong-guo, Mu
    Shi, An
    Qian, Zhao
    2009 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (16TH), VOLS I AND II, CONFERENCE PROCEEDINGS, 2009, : 414 - +
  • [28] Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
    Ken Kobayashi
    Yuichi Takano
    Kazuhide Nakata
    Journal of Global Optimization, 2021, 81 : 493 - 528
  • [29] Risk preferences, newsvendor orders and supply chain coordination using the Mean-CVaR model
    Jammernegg, Werner
    Kischka, Peter
    Silbermayr, Lena
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2024, 270
  • [30] Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization
    Kobayashi, Ken
    Takano, Yuichi
    Nakata, Kazuhide
    JOURNAL OF GLOBAL OPTIMIZATION, 2021, 81 (02) : 493 - 528