Abstract

This study addresses a dynamic lot-sizing problem for remanufacturing systems in which end-of-use/life products are disassembled into their parts on a single disassembly workstation and then each part is reprocessed on one of the parallel reprocessing workstations. The problem, which integrates disassembly and reprocessing lot-sizing for multi-level disassembly structures, determines disassembly and reprocessing lot-sizes as well as the workstation on which each part is reprocessed, while satisfying workstation capacities and reprocessed part demands in each period of a planning horizon. An integer programming model is developed that minimizes the sum of set-up, operation and inventory costs. After the NP hardness is shown, two-stage heuristics are proposed in which an initial solution is obtained and then improved by full and partial bi-directional moves. Computational results show that the full move-based heuristic gives near-optimal solutions for small-sized instances and the partial move-based heuristic gives fast solutions with appropriate qualities.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call