ABSTRACT

This paper addresses the problem of disassembly lot-sizing for the single-product type. Due to some specific characteristics of disassembly systems, surplus inventory can be generated while satisfying the demand for the components. Disposal decisions are considered here to avoid inventory accumulations throughout the planning horizon. Three new mixed-integer programming (MIP) formulations are proposed to model the problem. The formulations differ from each other concerning the quality of the lower bound provided by their linear relaxation, which is an important issue in MIP resolution methods. Two efficient heuristics are also investigated for real-case applications when MIP algorithms are not relevant. The three formulations and the performance of the heuristics are compared based on new randomly generated instances for disassembly lot-sizing problems. As a managerial insight, the disposal decisions in disassembly lot-sizing models are relevant to save inventory costs.

摘要

本文解决了单品类型的拆解批量问题。由于拆解系统的一些特殊性，在满足零部件需求的同时，可以产生剩余库存。此处考虑处置决策，以避免整个计划范围内的库存积累。提出了三种新的混合整数规划 (MIP) 公式来对问题进行建模。在由线性松弛提供的下界质量方面，这些公式彼此不同，这是 MIP 分辨率方法中的一个重要问题。当 MIP 算法不相关时，还针对实际应用程序研究了两种有效的启发式方法。三种公式和启发式算法的性能基于新的随机生成的反汇编批量问题实例进行比较。作为管理洞察力，拆卸批量模型中的处置决策与节省库存成本相关。