IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v32y2023i3p930-950.html
   My bibliography  Save this article

Redundancy allocation under state‐dependent distributional uncertainty of component lifetimes

Author

Listed:
  • Jun Li
  • Yizhe Huang
  • Yan‐Fu Li
  • Shuming Wang

Abstract

In this paper, we consider a redundancy allocation problem in a series‐parallel system with uncertain component lifetimes of multiple states, which involves multitype components and mixed redundancy strategy. We develop a distributionally robust redundancy allocation model using state‐dependent ambiguity set, which describes the mean, expected cross‐deviation, and the support conditional on each state of the component lifetime distribution. Our structural analysis of the worst‐case system reliability function identifies a concave equivalent for the conditional worst‐case reliability function in each state and achieves an averaged finite piece‐wise affine representation for the overall worst‐case system reliability function, which enjoys valuable operational insights for reliability evaluation and scalable optimization of the redundancy designs. Furthermore, we analyze the reliability guarantees for the worst‐case reliability in optimality under possible misspecification of ambiguity‐set parameters, which admit the structure of “Reliability Target + Target Surplus + Estimated Elasticity,” and insightfully imply that the auxiliary dual variables obtained via solving the design problem can be regarded as the scale of elasticity. Computationally, the redundancy design problem can be linearized and reformulated as a mixed 0–1 second‐order cone program. Exploiting the above finite piece‐wise affine structure of the worst‐case reliability function, the design problem also admits a practical iterative decomposition scheme with finite convergence, which is more scalable especially for the possible situations of large number of states in practice. Finally, numerical experiments including a case with real‐life data of braking system components well justify the value of state information incorporated by our model in producing favorable cost‐effective redundancy designs for reliability operations.

Suggested Citation

  • Jun Li & Yizhe Huang & Yan‐Fu Li & Shuming Wang, 2023. "Redundancy allocation under state‐dependent distributional uncertainty of component lifetimes," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 930-950, March.
  • Handle: RePEc:bla:popmgt:v:32:y:2023:i:3:p:930-950
    DOI: 10.1111/poms.13906
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13906
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.13906?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    2. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    3. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    4. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    5. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    6. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    7. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    8. Shuming Wang & Yan-Fu Li & Tong Jia, 2020. "Distributionally Robust Design for Redundancy Allocation," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 620-640, July.
    9. İhsan Yanıkoğlu & Dick den Hertog, 2013. "Safe Approximations of Ambiguous Chance Constraints Using Historical Data," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 666-681, November.
    10. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    2. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    3. L. Jeff Hong & Zhiyuan Huang & Henry Lam, 2021. "Learning-Based Robust Optimization: Procedures and Statistical Guarantees," Management Science, INFORMS, vol. 67(6), pages 3447-3467, June.
    4. Georgia Perakis & Melvyn Sim & Qinshen Tang & Peng Xiong, 2023. "Robust Pricing and Production with Information Partitioning and Adaptation," Management Science, INFORMS, vol. 69(3), pages 1398-1419, March.
    5. Liu, Kanglin & Li, Qiaofeng & Zhang, Zhi-Hai, 2019. "Distributionally robust optimization of an emergency medical service station location and sizing problem with joint chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 79-101.
    6. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    7. Guopeng Song & Roel Leus, 2022. "Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3059-3079, November.
    8. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    9. Zhang, Hanxiao & Li, Yan-Fu, 2022. "Robust optimization on redundancy allocation problems in multi-state and continuous-state series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 218(PA).
    10. Viet Anh Nguyen & Fan Zhang & Jose Blanchet & Erick Delage & Yinyu Ye, 2021. "Robustifying Conditional Portfolio Decisions via Optimal Transport," Papers 2103.16451, arXiv.org, revised Jul 2022.
    11. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.
    12. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    13. Roos, Ernst & den Hertog, Dick, 2019. "Reducing conservatism in robust optimization," Other publications TiSEM ad0238cd-de7a-4366-b487-b, Tilburg University, School of Economics and Management.
    14. Shuming Wang & Yan-Fu Li & Tong Jia, 2020. "Distributionally Robust Design for Redundancy Allocation," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 620-640, July.
    15. Tianqi Liu & Francisco Saldanha-da-Gama & Shuming Wang & Yuchen Mao, 2022. "Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2776-2803, September.
    16. Yu Wang & Yu Zhang & Minglong Zhou & Jiafu Tang, 2023. "Feature‐driven robust surgery scheduling," Production and Operations Management, Production and Operations Management Society, vol. 32(6), pages 1921-1938, June.
    17. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    18. Zhi Chen & Peng Xiong, 2023. "RSOME in Python: An Open-Source Package for Robust Stochastic Optimization Made Easy," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 717-724, July.
    19. Zhang, Guowei & Jia, Ning & Zhu, Ning & He, Long & Adulyasak, Yossiri, 2023. "Humanitarian transportation network design via two-stage distributionally robust optimization," Transportation Research Part B: Methodological, Elsevier, vol. 176(C).
    20. Feng Liu & Zhi Chen & Shuming Wang, 2023. "Globalized Distributionally Robust Counterpart," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1120-1142, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:bla:popmgt:v:32:y:2023:i:3:p:930-950. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.