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

Scenario-based multi-objective robust scheduling for a semiconductor production line

Author

Listed:
  • Juan Liu
  • Fei Qiao
  • Weichang Kong

Abstract

Scheduling problems of semiconductor manufacturing systems (SMS) with the goal of optimising some classical performance indices (NP-hard), tend to be increasingly complicated due to stochastic uncertainties. This paper targets the robust scheduling problem of an SMS with uncertain processing times. A three-stage multi-objective robust optimisation (MORO) approach is proposed, that can collaboratively optimise the performance indices and their robustness measures. In the first stage, this paper studies the scheduling problem in the deterministic environment and obtains feasible scheduling strategies that perform well in four performance indices (the average cycle time (CT), the on-time delivery rate (ODR), the throughput (TP), and the total movement amount of wafers (MOV)). Then, in the second stage, the uncertainties are introduced into the production system. In the third stage, this paper proposes a hybrid method consisting of scenario planning, discrete simulation, and multi-objective optimisation to obtain an approximately and more robust optimal solution from the feasible scheduling strategy set. The proposed MORO approach is tested in a semiconductor experiment production line and makes a full analysis to illustrate the effectiveness of our method. The results show that our MORO is superior concerning the total robustness with multi-objective.

Suggested Citation

  • Juan Liu & Fei Qiao & Weichang Kong, 2019. "Scenario-based multi-objective robust scheduling for a semiconductor production line," International Journal of Production Research, Taylor & Francis Journals, vol. 57(21), pages 6807-6826, November.
  • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:21:p:6807-6826
    DOI: 10.1080/00207543.2019.1641234
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2019.1641234?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. Jiao Zhao & Tao Wang & Thibaud Monteiro, 2024. "A Bi-Objective Home Health Care Routing and Scheduling Problem under Uncertainty," IJERPH, MDPI, vol. 21(3), pages 1-27, March.

    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:21:p:6807-6826. 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.