IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v103y1999i3d10.1023_a1021731907266.html
   My bibliography  Save this article

Optimal Sequencing of Inspection of Dependent Characteristics

Author

Listed:
  • S. O. Duffuua

    (King Fahd University of Petroleum and Minerals)

  • S. M. Pollock

    (University of Michigan)

Abstract

We address the problem of sequentially inspecting the dependent characteristics of a product, where the dependency is expressed in terms of the joint probabilities of the fitness of the characteristics. We show that, even when the inspection has classification errors, the joint probability mass function of the observed fitness of the characteristics is independent of the sequence of inspection. Using this result, a dynamic programming approach is presented for finding the optimal sequence that minimizes the expected total cost of inspection. Previously reported policies for independent characteristics are shown to be special cases of the results presented here.

Suggested Citation

  • S. O. Duffuua & S. M. Pollock, 1999. "Optimal Sequencing of Inspection of Dependent Characteristics," Journal of Optimization Theory and Applications, Springer, vol. 103(3), pages 557-565, December.
    • Handle: RePEc:spr:joptap:v:103:y:1999:i:3:d:10.1023_a:1021731907266
    DOI: 10.1023/A:1021731907266
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1021731907266
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1021731907266?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. E. L. Lawler & B. D. Sivazlian, 1978. "Minimization of Time-Varying Costs in Single-Machine Scheduling," Operations Research, INFORMS, vol. 26(4), pages 563-569, August.
    Full references (including those not matched with items on IDEAS)

    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. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    2. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.

    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:spr:joptap:v:103:y:1999:i:3:d:10.1023_a:1021731907266. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.