A lot sizing and sequencing algorithm for dynamic demands upon a single facility
提出一种启发式算法，用于单一设施上多产品的批量确定与生产排序，考虑动态需求、库存持有成本及占用产能的换模时间，实际应用显著降低库存成本并消除延迟交付。
Abstract A heuristic algorithm is developed and applied to determine lot sizes and production sequence on a single facility. The various product demands are treated as deterministic and time varying (dynamic) over a finite planning horizon, such as that generated from a material requirements planning (MRP) system. In contrast to other approaches available, the algorithm considers the sequencing decision in each period by realistically assuming inventory holding cost occurrence in the period of production, and in addition, it is capable of considering set‐up times where such set‐up times consume available productive capacity. The ability to handle numerous products, and the capability of being able to specify maintenance time and holidays is an integral aspect of the algorithm. The results of an application of the algorithm in a medium size bearing company have shown very significant reduction in the controllable inventory holding cost while eliminating late deliveries. In an effort to cope with potential realistic schedule alterations, different solutions were developed for managerial evaluation providing greater flexibility but at a higher cost.