Linear programming in disassembly/clustering sequence generation

Lambert, AJD

doi:10.1016/S0360-8352(99)00162-X

Return

Linear programming in disassembly/clustering sequence generation

1999-09-01

168

PRE

Lambert, AJD *

DOI：10.1016/S0360-8352(99)00162-X

Original

Original request for help

Save

Abstract

En 中文

Based on earlier research on optimal disassembly sequence generation, notably graphically supported search methods, a method for solving general optimal disassembly sequence generation problems by linear programming has been developed and described. This method puts no serious restriction to the size of the model,lt is adaptable to changes in model structures and constraints, and it is even not restricted to divergent operations, such as disassembly. This is demonstrated by solving the combined disassembly/clustering problem. Clustering is the combination of different disassembly products to categories that can be considered - and sold - as a single product, e.g. steel parts. The theoretical model is validated and clarified by its application to some standard problems from literature. (C) 1999 Elsevier Science Ltd. All rights reserved.

Keywords:

disassembly sequence

recycling

mathematical programming

design for disassembly

design for environment

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.