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

Online control by attributes in the presence of classification errors with variable inspection interval

Author

Listed:
  • Lupércio F. Bessegato
  • Lucas S. Mota
  • Roberto C. Quinino

Abstract

The procedure for online control by attribute consists of inspecting a single item at every m items produced (m ≥ 2). On each inspection, it is determined whether the fraction of the produced conforming items decreased. If the inspected item is classified as non conforming, the productive process is adjusted so that the conforming fraction returns to its original status. A generalization observed in the literature is to consider inspection errors and vary the inspection interval. This study presents an extension of this model by considering that the inspected item can be rated independently r (r ≥ 1) times. The process is adjusted every time the number of conforming classifications is less than a, 1 ≤ a ≤ r. This method uses the properties of an ergodic Markov chain to obtain the expression for the average cost of this control system. The genetic algorithm methodology is used to search for the optimal parameters that minimize the expected cost. The procedure is illustrated by a numerical example.

Suggested Citation

  • Lupércio F. Bessegato & Lucas S. Mota & Roberto C. Quinino, 2016. "Online control by attributes in the presence of classification errors with variable inspection interval," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 45(11), pages 3283-3301, June.
    • Handle: RePEc:taf:lstaxx:v:45:y:2016:i:11:p:3283-3301
    DOI: 10.1080/03610926.2014.901376
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2014.901376
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2014.901376?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:45:y:2016:i:11:p:3283-3301. 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.