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

Optimal designing of a new mixed variable lot-size chain sampling plan based on the process capability index

Author

Listed:
  • S. Balamurali

Abstract

In this paper, a new mixed sampling plan based on the process capability index (PCI) Cpk is proposed and the resultant plan is called mixed variable lot-size chain sampling plan (ChSP). The proposed mixed plan comprises of both attribute and variables inspections. The variable lot-size sampling plan can be used for inspection of attribute quality characteristics and for the inspection of measurable quality characteristics, the variables ChSP based on PCI will be used. We have considered both symmetric and asymmetric fraction non conforming cases for the variables ChSP. Tables are developed for determining the optimal parameters of the proposed mixed plan based on two points on the operating characteristic (OC) approach. In order to construct the tables, the problem is formulated as a non linear programming where the average sample number function is considered as an objective function to be minimized and the lot acceptance probabilities at acceptable quality level and limiting quality level under the OC curve are considered as constraints. The practical implementation of the proposed mixed sampling plan is explained with an illustrative real time example. Advantages of the proposed sampling plan are also discussed in terms of comparison with other existing sampling plans.

Suggested Citation

  • S. Balamurali, 2018. "Optimal designing of a new mixed variable lot-size chain sampling plan based on the process capability index," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 47(10), pages 2490-2503, May.
  • Handle: RePEc:taf:lstaxx:v:47:y:2018:i:10:p:2490-2503
    DOI: 10.1080/03610926.2017.1339089
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2017.1339089
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2017.1339089?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:47:y:2018:i:10:p:2490-2503. 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.