IDEAS home Printed from https://ideas.repec.org/a/eee/reensy/v190y2019ic15.html
   My bibliography  Save this article

An approach for design Verification and Validation planning and optimization for new product reliability improvement

Author

Listed:
  • Mobin, Mohammadsadegh
  • Li, Zhaojun
  • Cheraghi, S. Hossein
  • Wu, Gongyu

Abstract

Product design Verification and Validation (V&V) is an integral part of the new product development process to verify that the newly developed product meets its engineering specifications and fulfills its intended functions. A V&V planning assigns various V&V activities such as various engineering tests and analytics to achieve expected product performance. This paper investigates a method for optimizing product design V&V planning in the early stages of product development to maximize the product reliability improvement. The proposed V&V planning model considers the priorities of the failure modes based on failure rate, detectability, and consequences. The sequencing of performing V&V activities and the effectiveness of each V&V activity in reducing failure rate and improving failure detectability are also considered. The objective of the V&V optimization model is to maximize the system reliability improvement by optimally selecting a set of V&V activities. The sequencing for V&V activities is formulated using the job shop scheduling concept. The set covering problem concept is applied to assure that all critical failure modes are covered. A V&V planning example of an engine power unit development is demonstrated and the results are compared with existing planning methods, which shows the advantages of the proposed V&V planning approach.

Suggested Citation

  • Mobin, Mohammadsadegh & Li, Zhaojun & Cheraghi, S. Hossein & Wu, Gongyu, 2019. "An approach for design Verification and Validation planning and optimization for new product reliability improvement," Reliability Engineering and System Safety, Elsevier, vol. 190(C), pages 1-1.
    • Handle: RePEc:eee:reensy:v:190:y:2019:i:c:15
    DOI: 10.1016/j.ress.2019.106518
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0951832018313231
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ress.2019.106518?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tyson R. Browning, 2009. "The many views of a process: Toward a process architecture framework for product development processes," Systems Engineering, John Wiley & Sons, vol. 12(1), pages 69-90, March.
    2. Zinder E.Z., 2016. "Expanding enterprise engineering paradigm," Бизнес-информатика, CyberLeninka;Федеральное государственное автономное образовательное учреждение высшего образования «Национальный исследовательский университет «Высшая школа экономики», issue 4 (38), pages 7-18.
    3. Bozzano, Marco & Cimatti, Alessandro & Katoen, Joost-Pieter & Katsaros, Panagiotis & Mokos, Konstantinos & Nguyen, Viet Yen & Noll, Thomas & Postma, Bart & Roveri, Marco, 2014. "Spacecraft early design validation using formal methods," Reliability Engineering and System Safety, Elsevier, vol. 132(C), pages 20-35.
    4. Tyson R. Browning, 1999. "Sources of schedule risk in complex system development," Systems Engineering, John Wiley & Sons, vol. 2(3), pages 129-142.
    5. Ahmed, Hussam & Chateauneuf, Alaa, 2014. "Optimal number of tests to achieve and validate product reliability," Reliability Engineering and System Safety, Elsevier, vol. 131(C), pages 242-250.
    6. Maroua Nouiri & Abdelghani Bekrar & Abderezak Jemai & Smail Niar & Ahmed Chiheb Ammari, 2018. "An effective and distributed particle swarm optimization algorithm for flexible job-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(3), pages 603-615, March.
    7. David Applegate & William Cook, 1991. "A Computational Study of the Job-Shop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 3(2), pages 149-156, May.
    8. Jingshan Li & Andrea Matta & Evren Sahin, 2016. "Health Care Systems Engineering," Post-Print hal-01737960, HAL.
    9. Richard S.J. Tol, 2016. "Distributional Implications of Geoengineering," Working Paper Series 08316, Department of Economics, University of Sussex Business School.
    10. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    11. Gabriela Estrada & Dan L. Shunk & Feng Ju, 2018. "Systematic continuous improvement model for variation management of key characteristics running with low capability," International Journal of Production Research, Taylor & Francis Journals, vol. 56(6), pages 2370-2387, March.
    12. Zentner, Irmela & Tarantola, Stefano & de Rocquigny, E., 2011. "Sensitivity analysis for reliable design verification of nuclear turbosets," Reliability Engineering and System Safety, Elsevier, vol. 96(3), pages 391-397.
    13. Murthy, D.N.P. & Rausand, M. & Virtanen, S., 2009. "Investment in new product reliability," Reliability Engineering and System Safety, Elsevier, vol. 94(10), pages 1593-1600.
    14. Bernard W. Taylor, III & Laurence J. Moore, 1980. "R&D Project Planning with Q-GERT Network Modeling and Simulation," Management Science, INFORMS, vol. 26(1), pages 44-59, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gongyu Wu & Zhaojun (Steven) Li & Pan Liu, 2022. "Risk-informed reliability improvement optimization for verification and validation planning based on set covering modeling," Journal of Risk and Reliability, , vol. 236(2), pages 357-370, April.
    2. Wang, Jingyuan & Liu, Zhen & Wang, Jiahong & Long, Bing & Zhou, Xiuyun, 2022. "A general enhancement method for test strategy generation for the sequential fault diagnosis of complex systems," Reliability Engineering and System Safety, Elsevier, vol. 228(C).

    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. Gongyu Wu & Zhaojun (Steven) Li & Pan Liu, 2022. "Risk-informed reliability improvement optimization for verification and validation planning based on set covering modeling," Journal of Risk and Reliability, , vol. 236(2), pages 357-370, April.
    2. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    3. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    4. Ramesh Bollapragada & Norman M. Sadeh, 2004. "Proactive release procedures for just‐in‐time job shop environments, subject to machine failures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1018-1044, October.
    5. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    6. Vipul Jain & Ignacio E. Grossmann, 2001. "Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 13(4), pages 258-276, November.
    7. A. Ozolins, 2020. "A new exact algorithm for no-wait job shop problem to minimize makespan," Operational Research, Springer, vol. 20(4), pages 2333-2363, December.
    8. Arkhipov, Dmitry & Battaïa, Olga & Lazarev, Alexander, 2019. "An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the Resource Constrained Project Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 275(1), pages 35-44.
    9. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    10. Diarmuid Grimes & Emmanuel Hebrard, 2015. "Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 268-284, May.
    11. Marco Pranzo & Dario Pacciarelli, 2016. "An iterated greedy metaheuristic for the blocking job shop scheduling problem," Journal of Heuristics, Springer, vol. 22(4), pages 587-611, August.
    12. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    13. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    14. Sophie Demassey & Christian Artigues & Philippe Michelon, 2005. "Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 17(1), pages 52-65, February.
    15. Mohammad Mahdi Ahmadian & Amir Salehipour, 2021. "The just-in-time job-shop scheduling problem with distinct due-dates for operations," Journal of Heuristics, Springer, vol. 27(1), pages 175-204, April.
    16. Bahman Naderi & Rubén Ruiz & Vahid Roshanaei, 2023. "Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 817-843, July.
    17. Jelke J. Hoorn, 2018. "The Current state of bounds on benchmark instances of the job-shop scheduling problem," Journal of Scheduling, Springer, vol. 21(1), pages 127-128, February.
    18. Pisut Pongchairerks, 2019. "A Two-Level Metaheuristic Algorithm for the Job-Shop Scheduling Problem," Complexity, Hindawi, vol. 2019, pages 1-11, March.
    19. Fatemi-Anaraki, Soroush & Tavakkoli-Moghaddam, Reza & Foumani, Mehdi & Vahedi-Nouri, Behdin, 2023. "Scheduling of Multi-Robot Job Shop Systems in Dynamic Environments: Mixed-Integer Linear Programming and Constraint Programming Approaches," Omega, Elsevier, vol. 115(C).
    20. Francis Sourd & Wim Nuijten, 2000. "Multiple-Machine Lower Bounds for Shop-Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 341-352, November.

    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:eee:reensy:v:190:y:2019:i:c:15. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/reliability-engineering-and-system-safety .

    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.