IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v55y2017i10p2961-2977.html
   My bibliography  Save this article

Optimisation of burn-in time considering the hidden loss of quality deviations in the manufacturing process

Author

Listed:
  • Yihai He
  • Linbo Wang
  • Yi Wei
  • Zhenzhen He

Abstract

The burn-in test time is an important parameter of the complex batch processing machine scheduling problem. The omission of the loss of quality deviations in manufacturing generates a non-comprehensive and imperfect result in the optimisation of burn-in time, which hinders the identification of proactive and economical optimisation strategies to prevent infant failure in manufacturing. To solve this problem, this study visualises and quantifies for the first time the hidden loss caused by quality deviations in manufacturing and uses it as a newly added constraint to optimise the burn-in time. Firstly, a quality loss model composed of visible yield loss and warranty costs related to measurable but undetectable reliability vulnerabilities is defined. Secondly, the loss effects of growing defects are measured during the burn-in test, and the optimal burn-in time expressed by the proposed quality loss model is traded off between the additional burn-in cost and the decreased quality loss for an acceptable low infant failure rate. Finally, the effectiveness of the proposed optimisation approach is demonstrated using actual data from a control board with a high infant failure rate. Results show that the proposed method can systematically combine the fundamental loss of quality deviations in the optimisation of burn-in time, which supplements the commonly used optimality criteria, with the upstream loss of quality deviations in the form of manufacturing defects.

Suggested Citation

  • Yihai He & Linbo Wang & Yi Wei & Zhenzhen He, 2017. "Optimisation of burn-in time considering the hidden loss of quality deviations in the manufacturing process," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2961-2977, May.
  • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:10:p:2961-2977
    DOI: 10.1080/00207543.2016.1262081
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2016.1262081?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dung-Ying Lin & Tzu-Yun Huang, 2021. "A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem," Mathematics, MDPI, vol. 9(7), pages 1-20, April.

    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:tprsxx:v:55:y:2017:i:10:p:2961-2977. 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/TPRS20 .

    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.