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

A hybrid learning-based meta-heuristic algorithm for scheduling of an additive manufacturing system consisting of parallel SLM machines

Author

Listed:
  • Mohammad Rohaninejad
  • Reza Tavakkoli-Moghaddam
  • Behdin Vahedi-Nouri
  • Zdeněk Hanzálek
  • Shadi Shirazian

Abstract

Additive manufacturing (AM) has been recognised as a promising technology under the context of Industry 4.0, which is reshaping manufacturing paradigms. A prominent type of AM machine is the selective laser melting (SLM) machine, in which several parts may form a job and be produced concurrently. This paper aims to investigate a scheduling problem in an AM system with non-identical parallel SLM machines. Since, in this system, there might be differences in the material types of parts, the required setup time between two consecutive jobs on the relevant machine is dependent on their material types. Accordingly, a bi-objective mathematical model is extended for the problem, considering the makespan and the total tardiness penalty as two objective functions. Due to the high complexity of the problem, an efficient hybrid meta-heuristic algorithm is developed by combining the non-dominated sorting genetic algorithm (NSGA-II) with a novel learning-based local search founded on the k-means clustering algorithm and a regression neural network. The local search enhances the exploitation ability of the NSGA-II while intelligently being taught during the solving procedure. Finally, the superiority of the proposed hybrid algorithm is demonstrated through a computational experiment.

Suggested Citation

  • Mohammad Rohaninejad & Reza Tavakkoli-Moghaddam & Behdin Vahedi-Nouri & Zdeněk Hanzálek & Shadi Shirazian, 2022. "A hybrid learning-based meta-heuristic algorithm for scheduling of an additive manufacturing system consisting of parallel SLM machines," International Journal of Production Research, Taylor & Francis Journals, vol. 60(20), pages 6205-6225, October.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:20:p:6205-6225
    DOI: 10.1080/00207543.2021.1987550
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2021.1987550?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:60:y:2022:i:20:p:6205-6225. 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.