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.

本研究解决了再制造系统的动态批量大小问题，在该系统中，报废/使用寿命产品在单个拆卸工作站上拆卸成零件，然后每个零件在并行再加工工作站之一上进行再加工。该问题是多级拆装结构的拆装和再加工批量集成问题，确定了拆装和再加工的批量以及每个零件在其上进行再加工的工作站，同时满足工作站的容量和每个周期的再加工零件需求。规划视野。开发了一个整数规划模型，以最小化设置、操作和库存成本的总和。显示 NP 硬度后，提出了两阶段启发式算法，其中获得初始解，然后通过完全和部分双向移动来改进。计算结果表明，完全基于移动的启发式为小型实例提供了接近最优的解决方案，而部分基于移动的启发式提供了具有适当质量的快速解决方案。