IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v74y2023i3p762-776.html
   My bibliography  Save this article

Economic design of multiple inspection plans via the expectation-maximization algorithm

Author

Listed:
  • Young H. Chun

Abstract

Because of inspection errors, expensive items such as computer chips are usually inspected more than once with the same testing device to further improve the quality of accepted items. Many researchers have considered various multiple inspection plans that minimize the expected total cost of inspection and misclassifications. We first propose a new Markovian inspection plan under which each item is tested repeatedly until we have a sufficient number of positive or negative test results. We then deal with the problem of estimating three model parameters: the type I and II errors of an automated test equipment and the fraction defective of incoming items. Because of computational difficulties in maximizing the likelihood of the three parameters, we propose the use of the expectation-maximization (EM) algorithm as an easy alternative. In a numerical analysis, we demonstrate the outstanding performance of our new inspection plan over previous ones.

Suggested Citation

  • Young H. Chun, 2023. "Economic design of multiple inspection plans via the expectation-maximization algorithm," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 74(3), pages 762-776, March.
  • Handle: RePEc:taf:tjorxx:v:74:y:2023:i:3:p:762-776
    DOI: 10.1080/01605682.2022.2053306
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/01605682.2022.2053306?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:tjorxx:v:74:y:2023:i:3:p:762-776. 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/tjor .

    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.