Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used products while satisfying the demand of their parts or components over a certain planning horizon. The objective is to minimize the sum of purchase, se...
Disassembly scheduling is the problem of determining the ordering and disassembly schedules of used products while satisfying the demand of their parts or components over a certain planning horizon. The objective is to minimize the sum of purchase, setup, disassembly operation, and inventory holding costs. This paper considers products with assembly structure, i.e., products without parts commonality, and suggests a heuristic in which an initial solution is obtained in the form of the minimal latest disassembly schedule, and then improved considering tradeoffs among different cost factors. To show the performance of the heuristic suggested in this paper, computational experiments were done on the modified existing examples and the results show that the heuristic can give optimal or very near optimal solutions within very short computation times.