A time-varying lot sizes approach for the economic lot scheduling problem with returns
研究了单设施下考虑退货的经济批量调度问题，提出一种基于时变批量的启发式算法，将问题分解为组合部分（生产频率和序列）和连续部分（生产时间和空闲时间），计算表明该方法误差较小。
We consider the economic lot scheduling problem with returns by assuming that each item is returned by a constant rate of demand. The goal is to find production frequencies, production sequences, production times, as well as idle times for several items subject to returns at a single facility. We propose a heu ristic algorithm based on a time-varying (TV) lot sizes approach. The problem is decomposed into two distinct portions: in the first, we find a combinatorial part (production frequencies and sequences) and in the second, we determine a continuous part (production and idle times) in a specific production sequence. We report computational results that show that, in many cases, the proposed TV lot sizes approach with consideration of returns yields a relatively minor error.