A New Heuristic for Disassembly Line Balancing Problems with AND/OR Precedence Relations

Disassembly operations are inevitable elements of product recovery with the disassembly line as the best choice to carry out the same. The product recovery operations are fully based on disassembly line balancing and because of this, disassembly lines have become the chaise of automated disassembly of returned product. It is difficult to find the optimal balance of a disassembly line because of its N-P hard nature. In this paper a new heuristic is proposed to assign the parts to the disassembly workstations under AND/OR precedence constraints. The heuristic solutions are known as intrinsically optimal/suboptimal solutions of the N-P hard problems. The solution obtained by proposed heuristic has been compared with other heuristic solutions. The heuristic tries to minimize the number of workstations and the cycle time of the line while addressing the different criteria. The methodology of the proposed heuristics has been illustrated with the help of examples and it has been observed that the heuristic generates significantly better result.