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

Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing

Author

Listed:
  • Wenyou Jia
  • Zhibin Jiang
  • You Li

Abstract

In this paper, a new combined scheduling algorithm is proposed to address the problem of minimising total weighted tardiness on re-entrant batch-processing machines (RBPMs) with incompatible job families in the semiconductor wafer fabrication system (SWFS). The general combined scheduling algorithm forms batches according to parameters from the real-time scheduling simulation platform (ReS2), and then sequences batches through slack-based mixed integer linear programming model (S-MILP), which is defined as batch-oriented combined scheduling algorithm. The new combined scheduling algorithm obtains families’ parameters from ReS2 and then sequences these families through modified S-MILP, which is defined as family-oriented combined scheduling algorithm. With rolling horizon control strategy, two combined scheduling algorithms can update RBPMs scheduling continually. The experiments are implemented on ReS2 of SWFS and ILOG CPLEX, respectively. The results demonstrate the effectiveness of our proposed methods.

Suggested Citation

  • Wenyou Jia & Zhibin Jiang & You Li, 2015. "Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing," International Journal of Production Research, Taylor & Francis Journals, vol. 53(6), pages 1866-1879, March.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:6:p:1866-1879
    DOI: 10.1080/00207543.2014.965355
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.965355
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.965355?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. Zhengcai Cao & Lijie Zhou & Biao Hu & Chengran Lin, 2019. "An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing with the Flexible Job Shop Scheduling Problem," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 61(3), pages 299-309, June.
    2. Jianxin Fang & Brenda Cheang & Andrew Lim, 2023. "Problems and Solution Methods of Machine Scheduling in Semiconductor Manufacturing Operations: A Survey," Sustainability, MDPI, vol. 15(17), pages 1-44, August.
    3. Sungwook Yoon & Jihyun Kim & Sukjae Jeong, 2017. "The Optimal Decision Combination in Semiconductor Manufacturing," Sustainability, MDPI, vol. 9(10), pages 1-19, October.

    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:53:y:2015:i:6:p:1866-1879. 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.