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

On an IC wire bonding machine production–inventory problem with time value of money

Author

Listed:
  • Dah-Chuan Gong
  • Jia-Lun Kang
  • Gary C. Lin
  • T. C. Hou

Abstract

The semiconductor industry in Taiwan has received excellent performance ratings in the past. SinoPac’s statistics in January, 2016 found that two of the top four global packaging and testing companies are from Taiwan, including ASE Group and SPIL. In the IC packaging process, the wire bonding machine requires careful attention. It is also costly at approximately 50% of the equipment investment. Thus, this paper focuses on wire bonding machines’ production problems. According to the on-site interviews, three key control modules are identified, which may change a machine to an out-of-control state and are responsible for 90% of the defective products. A mathematical model is developed to determine the optimal production time of an imperfect production process. Taking the time value of money, the objective is to minimise the total of the set-up cost, inventory cost and the defect cost. Besides applying MacLaurin Series, a math property and an effective solution range are derived to help obtain near-optimal solutions. For the justification of solution quality, the bisection method working on practical data is used. Finally, managerial insights are explored from observed outputs through the changes of various parameters. Moreover, these explorations are confirmed by experts in this field.

Suggested Citation

  • Dah-Chuan Gong & Jia-Lun Kang & Gary C. Lin & T. C. Hou, 2017. "On an IC wire bonding machine production–inventory problem with time value of money," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2431-2453, May.
  • Handle: RePEc:taf:tprsxx:v:55:y:2017:i:9:p:2431-2453
    DOI: 10.1080/00207543.2016.1213914
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2016.1213914?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:tprsxx:v:55:y:2017:i:9:p:2431-2453. 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.