IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v21y2005i3p227-239.html
   My bibliography  Save this article

Bounds to optimal burn‐in and optimal work size

Author

Listed:
  • Ji Hwan Cha
  • Jie Mi

Abstract

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.

Suggested Citation

  • Ji Hwan Cha & Jie Mi, 2005. "Bounds to optimal burn‐in and optimal work size," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 21(3), pages 227-239, May.
    • Handle: RePEc:wly:apsmbi:v:21:y:2005:i:3:p:227-239
    DOI: 10.1002/asmb.550
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/asmb.550
    Download Restriction: no
    File URL: https://libkey.io/10.1002/asmb.550?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
    ---><---

    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:wly:apsmbi:v:21:y:2005:i:3:p:227-239. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    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.