Hide/Show Apps

Part selection problem in disassembly systems

Download
2006
Yetere, Ayça
In this study, we consider the disassembly problem of end-of-life (EOL) products for recovering valuable parts or assemblies. All parts obtained by disassembly processes of an EOL product may not be profitable due to their high recovery costs. Our problem is to select the parts to be released and determine the associated disassembly tasks so as to maximize the total profit. We first tackle the simple part selection problem, and then introduce a time constraint for the tasks to be performed for selected parts and search for incomplete time constrained sequences. We formulate our first problem as a Mixed Integer Problem and show that the constraint set of this formulation is totally unimodular. We also provide the dual formulation of our problem and its interpretation. For time-constrained part selection problem we propose a branch-and-bound algorithm. We first develop some reduction mechanism to reduce the size of the problem. Our solution procedure is capable of solving problems with up to 94 parts and tasks.