Constraint programming for multi-line parallel partial disassembly line balancing problem with optional common stations

Abstract

Due to the increased demand for efficient recycling systems for end-of-life (EOL) products, the role of disassembly lines in reverse supply chains has become crucial. Parallel disassembly lines can handle multi-type EOL products and consist of two or more lines. However, previous research has primarily focused on two-line disassembly systems and has not fully addressed the optionality of common stations. To address this gap, this study proposes three exact methods for optimizing multi-line parallel disassembly systems with optional common stations, partial disassembly mode, and AND/OR precedence relations. Firstly, a mixed-integer linear programming (MILP) model is formulated that optimizes three objectives: weighted line length, additional profits, and hazard evaluation. Secondly, two constraint programming (CP) models are developed with different solution methodologies to provide more extensive applications and efficient solutions. An illustrative example shows that production mode can significantly reduce line length and workstations, and computational results demonstrate that both CP methods outperform the MILP model in terms of solution quality and computational efficiency. Specifically, the CP-I method demonstrates a higher level of stability and efficiency in most instances, while the CP-II method excels in optimizing line length and station utilization. These results illustrate the potential for optimizing multi-line disassembly systems with optional common stations to enhance production flexibility in remanufacturing processes.