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

A configuration optimization approach for reconfigurable manufacturing system based on column-generation combined with graph neural network

Author

Listed:
  • Feng Cui
  • Zhibin Jiang
  • Xin Zhou
  • Junli Zheng
  • Na Geng

Abstract

Reconfigurable manufacturing systems (RMS) offer the potential to improve systemic responsiveness and flexibility to better cope with dynamic environments. However, the inherent modularity of RMS and dynamic environments pose challenges in optimising system configurations. To address this issue, a two-stage stochastic programming model is established to minimise configuration cost, reconfiguration cost, expected inventory and back-order cost. To efficiently handle a large number of variables, a set-covering model is obtained by using Danzig-Wolfe (DW) decomposition along with its corresponding pricing subproblem. This paper proposes a solution algorithm based on the column generation framework, which can quickly obtain a good feasible solution. To further improve the algorithm performance for larger instances, a column selection method is introduced to identify additional columns that have the potential to reduce the objective function value of the integer solution during the column generation iterations. These columns are then added to the set-covering model. The process of column selection is accelerated by employing the Graph Neural Network (GNN) algorithm. Furthermore, GNN trained on data from small instances can be directly applied to larger instances as well. The effectiveness of the proposed model and algorithm is verified by numerical experiments.

Suggested Citation

  • Feng Cui & Zhibin Jiang & Xin Zhou & Junli Zheng & Na Geng, 2025. "A configuration optimization approach for reconfigurable manufacturing system based on column-generation combined with graph neural network," International Journal of Production Research, Taylor & Francis Journals, vol. 63(3), pages 970-991, February.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:3:p:970-991
    DOI: 10.1080/00207543.2024.2366992
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2366992?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:63:y:2025:i:3:p:970-991. 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.