Linear programming in disassembly/clustering sequence generation

Based on earlier research on optimal disassembly sequence generation, notab ly graphically supported search methods, a method for solving general optim al disassembly sequence generation problems by linear programming has been developed and described. This method puts no serious restriction to the siz e of the model,lt is adaptable to changes in model structures and constrain ts, and it is even not restricted to divergent operations, such as disassem bly. This is demonstrated by solving the combined disassembly/clustering pr oblem. Clustering is the combination of different disassembly products to c ategories that can be considered - and sold - as a single product, e.g. ste el parts. The theoretical model is validated and clarified by its application to some standard problems from literature. (C) 1999 Elsevier Science Ltd. All righ ts reserved.