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

Learning per-machine linear dispatching rule for heterogeneous multi-machines control

Author

Listed:
  • Namyong Kim
  • Stephane Barde
  • Kiwook Bae
  • Hayong Shin

Abstract

This paper proposes a per-machine linear dispatching rule learning approach to improve the scheduling of re-entrant flow shop such as semiconductor fab. Finding an optimal schedule of a complex manufacturing system is intractable; hence, a dispatching rule as a heuristic approach is widely used in actual practice. Also, to develop a good dispatching rule, an automated methodology for developing heuristics, also known as a hyper-heuristic, has been studied extensively. However, most of the literature has focused on finding a single-sophisticated dispatching rule, in which every machine uses the same rule. Such an approach often shows suboptimal performance when the optimal dispatching rule is different on each machine. To solve this problem, we introduce a simple and effective per-machine dispatching rule learning approach, in which each machine has one linear dispatching rule that is optimised by the Gradient-based Evolutionary Strategy (GES). This method is sample-efficient and can be applied to non-differentiable objective functions such as average Cycle Time. The proposed approach was mainly compared to two popular methods based on Genetic Programming (GP) and the Genetic Algorithm (GA) on a four-station and eight-machine re-entrant flow shop. Numerical results show that the proposed approach outperforms widely used methods.

Suggested Citation

  • Namyong Kim & Stephane Barde & Kiwook Bae & Hayong Shin, 2023. "Learning per-machine linear dispatching rule for heterogeneous multi-machines control," International Journal of Production Research, Taylor & Francis Journals, vol. 61(1), pages 162-182, January.
  • Handle: RePEc:taf:tprsxx:v:61:y:2023:i:1:p:162-182
    DOI: 10.1080/00207543.2021.1942283
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.1942283?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:61:y:2023:i:1:p:162-182. 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.