IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i3d10.1007_s10696-024-09537-x.html
   My bibliography  Save this article

A machine learning framework for explainable knowledge mining and production, maintenance, and quality control optimization in flexible circular manufacturing systems

Author

Listed:
  • Georgios K. Koulinas

    (Democritus University of Thrace)

  • Panagiotis D. Paraschos

    (Democritus University of Thrace)

  • Dimitrios E. Koulouriotis

    (National Technical University of Athen)

Abstract

In the present study, we employed multiple decision tree algorithms to categorize cases and reflect the most efficient policies constructed by a reinforcement learning algorithm. These approaches treated a complex production, maintenance, and quality control optimization problem within a degrading manufacturing and remanufacturing system. The decision trees’ nodes represent the independent variables, while the trees’ leaves represent the set of function values. The reinforcement learning method revealed all optimization parameters and best policies, which were employed as the training sample for the tree algorithms. After constructing every decision tree, each resulting decision rule was used to solve the optimization problem, and its performance was assessed. Additionally, we performed a sensitivity analysis to determine if the pruning level impacts the objective function value and, generally, the effectiveness of the proposed approach.

Suggested Citation

  • Georgios K. Koulinas & Panagiotis D. Paraschos & Dimitrios E. Koulouriotis, 2024. "A machine learning framework for explainable knowledge mining and production, maintenance, and quality control optimization in flexible circular manufacturing systems," Flexible Services and Manufacturing Journal, Springer, vol. 36(3), pages 737-759, September.
  • Handle: RePEc:spr:flsman:v:36:y:2024:i:3:d:10.1007_s10696-024-09537-x
    DOI: 10.1007/s10696-024-09537-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-024-09537-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10696-024-09537-x?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.

    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:spr:flsman:v:36:y:2024:i:3:d:10.1007_s10696-024-09537-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.