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

AND/OR graph generation for disassembly analysis: Deeply-nested subassemblies represented by a hypergraph

Author

Listed:
  • S. Iwase

Abstract

Manufacturers are demonstrating increased responsibility towards the environmental performance of their products throughout their life-cycles to promote a sustainable society and attain the sustainable development goal of being ‘responsible consumption and production’. Designers need to pivot from production-oriented to environmental-protection designs, prioritising reusability and recyclability from the onset of the design process. Consequently, a design for disassembly (DfD) strategy has been developed. This study proposes a method to construct a disassembly model for a complex product using a hypergraph representing its subassemblies as hyperedges. Hypergraphs can represent deeply-nested subassembly structures in a single matrix, and the disassembly precedence relationships can be easily determined using a ‘cut-set’ matrix newly defined in this study from the incidence matrices of the graph and hypergraph. Designers can easily modify subassembly elements by changing the hyperedge and building disassembly models for various cases. The disassembly model is represented as an AND/OR graph, and the effectiveness of this algorithm is demonstrated in two realistic case studies. The proposed approach will facilitate integrating reusability and recyclability into products, which will help address global warming and carbon neutrality.

Suggested Citation

  • S. Iwase, 2025. "AND/OR graph generation for disassembly analysis: Deeply-nested subassemblies represented by a hypergraph," International Journal of Production Research, Taylor & Francis Journals, vol. 63(8), pages 3035-3063, April.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:8:p:3035-3063
    DOI: 10.1080/00207543.2024.2416560
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/00207543.2024.2416560?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:8:p:3035-3063. 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.