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

Hierarchy machine set-up for multi-pass lot scheduling at semiconductor assembly and test facilities

Author

Listed:
  • Youngbum Hur
  • Jonathan F. Bard
  • Rodolfo Chacon

Abstract

In this paper, we examine the set-up problem at semiconductor assembly and test facilities in a multi-machine, multi-tooling environment. Our primary objectives are to minimise the number of shortages of key devices and to maximise weighted throughput over a 2–5-day planning horizon. When a machine set-up is called for three components must be taken into account: tooling, package size and flow. Each in turn imposes increasing set-up times, ranging from a few minutes to half a day. To balance system efficiency with meeting customer demand, a hierarchical approach is taken. Priority is first given to set-ups that can process (hot) lots that reduce demand shortages. Next, changeover time is factored into the decision. Here, priority is given to the component that takes the least amount of time. Our model determines machine set-ups, lot assignments and lot sequences using a greedy randomised adaptive search procedure. The results indicate that reducing set-up times can reduce hot-lot shortages by up to 6.6% over a two-day period and that following the hierarchy set-up rule while prioritising key device lots can reduce shortages by up to 10%. Moreover, when reentrant flow is taken into account, improvements of up to 42% may be realised.

Suggested Citation

  • Youngbum Hur & Jonathan F. Bard & Rodolfo Chacon, 2019. "Hierarchy machine set-up for multi-pass lot scheduling at semiconductor assembly and test facilities," International Journal of Production Research, Taylor & Francis Journals, vol. 57(14), pages 4351-4370, July.
  • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:14:p:4351-4370
    DOI: 10.1080/00207543.2017.1380327
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2017.1380327?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:57:y:2019:i:14:p:4351-4370. 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.