Matches in SemOpenAlex for { <https://semopenalex.org/work/W2022726105> ?p ?o ?g. }
Showing items 1 to 83 of
83
with 100 items per page.
- W2022726105 endingPage "58" @default.
- W2022726105 startingPage "46" @default.
- W2022726105 abstract "Purpose The purpose of this paper is to propose a framework to identify all the feasible disassembly sequences for a multi‐component product and to find an optimal disassembly sequence, according to specific criteria such as cost, duration, profit, etc. Design/methodology/approach Taking into account topological and geometrical constraints of a product structure, an AND/OR disassembly graph is built. Each graph node represents a feasible subassembly. Two nodes i and j are connected by an arc ( i, j ), called a transition, if the subassembly j can be obtained from the subassembly i by removing one or several connectors. Constraint programming approach is used to generate the feasible subassemblies and related transitions. Findings If a cost z ij is incurred to perform a transition ( i, j ), an optimal disassembly sequence can be generated for a given subassembly, using the shortest path algorithm or a linear programming model. Research limitations/implications The proposed approach performs very well compared to other approaches published in the literature, even when applied to products requiring parallel disassembly and including a large number of parts. Practical implications This approach has been successfully applied to assess the wheelchair maintainability at the design stage and will be implemented in CAD systems. One other application, regarding the disassembly process and total revenue maximization for product recycling, is now under consideration. Originality/value Applying constraint programming to efficiently generate the set of the feasible subassemblies constitutes the main contribution in this paper. This process is the hardest step in the disassembly sequencing problem." @default.
- W2022726105 created "2016-06-24" @default.
- W2022726105 creator A5002732251 @default.
- W2022726105 creator A5024063857 @default.
- W2022726105 creator A5037382671 @default.
- W2022726105 creator A5087388531 @default.
- W2022726105 date "2008-03-28" @default.
- W2022726105 modified "2023-10-18" @default.
- W2022726105 title "Optimal disassembly sequencing strategy using constraint programming approach" @default.
- W2022726105 cites W1993748806 @default.
- W2022726105 cites W2008884414 @default.
- W2022726105 cites W2024505933 @default.
- W2022726105 cites W2036160449 @default.
- W2022726105 cites W2042951273 @default.
- W2022726105 cites W2059890236 @default.
- W2022726105 cites W2072406661 @default.
- W2022726105 cites W2151645094 @default.
- W2022726105 cites W2168412825 @default.
- W2022726105 cites W4242995941 @default.
- W2022726105 doi "https://doi.org/10.1108/13552510810861932" @default.
- W2022726105 hasPublicationYear "2008" @default.
- W2022726105 type Work @default.
- W2022726105 sameAs 2022726105 @default.
- W2022726105 citedByCount "16" @default.
- W2022726105 countsByYear W20227261052012 @default.
- W2022726105 countsByYear W20227261052013 @default.
- W2022726105 countsByYear W20227261052014 @default.
- W2022726105 countsByYear W20227261052015 @default.
- W2022726105 countsByYear W20227261052017 @default.
- W2022726105 countsByYear W20227261052018 @default.
- W2022726105 countsByYear W20227261052021 @default.
- W2022726105 countsByYear W20227261052023 @default.
- W2022726105 crossrefType "journal-article" @default.
- W2022726105 hasAuthorship W2022726105A5002732251 @default.
- W2022726105 hasAuthorship W2022726105A5024063857 @default.
- W2022726105 hasAuthorship W2022726105A5037382671 @default.
- W2022726105 hasAuthorship W2022726105A5087388531 @default.
- W2022726105 hasConcept C111919701 @default.
- W2022726105 hasConcept C11413529 @default.
- W2022726105 hasConcept C126255220 @default.
- W2022726105 hasConcept C127413603 @default.
- W2022726105 hasConcept C137631369 @default.
- W2022726105 hasConcept C160713754 @default.
- W2022726105 hasConcept C173404611 @default.
- W2022726105 hasConcept C200601418 @default.
- W2022726105 hasConcept C33923547 @default.
- W2022726105 hasConcept C41008148 @default.
- W2022726105 hasConcept C41045048 @default.
- W2022726105 hasConcept C98045186 @default.
- W2022726105 hasConceptScore W2022726105C111919701 @default.
- W2022726105 hasConceptScore W2022726105C11413529 @default.
- W2022726105 hasConceptScore W2022726105C126255220 @default.
- W2022726105 hasConceptScore W2022726105C127413603 @default.
- W2022726105 hasConceptScore W2022726105C137631369 @default.
- W2022726105 hasConceptScore W2022726105C160713754 @default.
- W2022726105 hasConceptScore W2022726105C173404611 @default.
- W2022726105 hasConceptScore W2022726105C200601418 @default.
- W2022726105 hasConceptScore W2022726105C33923547 @default.
- W2022726105 hasConceptScore W2022726105C41008148 @default.
- W2022726105 hasConceptScore W2022726105C41045048 @default.
- W2022726105 hasConceptScore W2022726105C98045186 @default.
- W2022726105 hasIssue "1" @default.
- W2022726105 hasLocation W20227261051 @default.
- W2022726105 hasLocation W20227261052 @default.
- W2022726105 hasOpenAccess W2022726105 @default.
- W2022726105 hasPrimaryLocation W20227261051 @default.
- W2022726105 hasRelatedWork W1981774706 @default.
- W2022726105 hasRelatedWork W1986397077 @default.
- W2022726105 hasRelatedWork W2012935950 @default.
- W2022726105 hasRelatedWork W2022674418 @default.
- W2022726105 hasRelatedWork W2042851557 @default.
- W2022726105 hasRelatedWork W2072929135 @default.
- W2022726105 hasRelatedWork W2899084033 @default.
- W2022726105 hasRelatedWork W2982586778 @default.
- W2022726105 hasRelatedWork W2987086094 @default.
- W2022726105 hasRelatedWork W3051529939 @default.
- W2022726105 hasVolume "14" @default.
- W2022726105 isParatext "false" @default.
- W2022726105 isRetracted "false" @default.
- W2022726105 magId "2022726105" @default.
- W2022726105 workType "article" @default.