Article ID: | iaor20051320 |
Country: | United Kingdom |
Volume: | 55 |
Issue: | 3 |
Start Page Number: | 287 |
End Page Number: | 297 |
Publication Date: | Mar 2004 |
Journal: | Journal of the Operational Research Society |
Authors: | Lee D.-H., Xirouchakis P. |
Keywords: | production, heuristics |
Disassembly scheduling, one of the important operational problems in disassembly systems, is the problem of determining the ordering and disassembly schedules of used or end-of-life products while satisfying the demand of their parts or components over a certain planning horizon. This paper considers products with assembly structure for the objective of minimizing the sum of purchase, set up, inventory holding, and disassembly operation costs, and suggests a two-stage heuristic, in which an initial solution is obtained in the form of the minimal latest ordering and disassembly schedule, and then improved iteratively considering trade-offs among different cost factors. To show the performance of the heuristic, computational experiments were done on the example obtained from the literature and a number of randomly generated test problems, and the results show that the heuristic can give optimal or very near-optimal solutions within very short computation times.