A heuristic for disassembly planning in remanufacturing system

Area of Science:

• Operations Research
• Industrial Engineering
• Sustainable Manufacturing

Background:

• Disassembly planning is crucial for remanufacturing efficiency.
• Existing methods may not adequately address technological and management constraints.
• Optimizing disassembly sequences and quantities is complex.

Purpose of the Study:

• To develop an efficient heuristic algorithm for disassembly planning in remanufacturing.
• To minimize disassembly costs considering various cost factors and constraints.
• To address the challenge of part/subassembly demands within the planning process.

Main Methods:

• Formulation of a mathematical model for disassembly planning.
• Development of a heuristic algorithm dividing the planning horizon into smaller windows.
• Minimization of disassembly costs including setup, inventory holding, processing, and purchasing costs.
• Consideration of sequence-dependent setup and capacity constraints.

Main Results:

• The proposed heuristic improves solution quality and computational efficiency.
• Dividing the planning horizon enhances computational performance with minimal loss of solution quality.
• The algorithm effectively determines disassembly operation sequences and quantities.

Conclusions:

• The heuristic algorithm offers a practical and efficient approach to disassembly planning in remanufacturing.
• This method can lead to significant cost reductions and improved operational efficiency.
• The study demonstrates the value of tailored algorithms for complex remanufacturing logistics.