IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v49y2020i15p3744-3760.html
   My bibliography  Save this article

A sampling plan for one-shot systems considering destructive inspection

Author

Listed:
  • Qian Qian Zhao
  • Won Young Yun

Abstract

The paper is concerned with an acceptance sampling problem under destructive inspections for one-shot systems. The systems may fail at random times while they are operating (as the systems are considered to be operating when storage begins), and these failures can only be identified by inspection. Thus, n samples are randomly selected from N one-shot systems for periodic destructive inspection. After storage time T, the N systems are replaced if the number of working systems is less than a pre-specified threshold k. The primary purpose of this study is to determine the optimal number of samples n*, extracted from the N for destructive detection and the optimal acceptance number k*, in the sample under the constraint of the system interval availability, to minimize the expected cost rate. Numerical experiments are studied to investigate the effect of the parameters in sampling inspection on the optimal solutions.

Suggested Citation

  • Qian Qian Zhao & Won Young Yun, 2020. "A sampling plan for one-shot systems considering destructive inspection," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 49(15), pages 3744-3760, August.
    • Handle: RePEc:taf:lstaxx:v:49:y:2020:i:15:p:3744-3760
    DOI: 10.1080/03610926.2020.1719159
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2020.1719159
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2020.1719159?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.

    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:taf:lstaxx:v:49:y:2020:i:15:p:3744-3760. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.