DYNAMIC LOT SIZING FOR A SINGLE‐FACILITY MULTIPRODUCT PROBLEM IN A ROLLING‐HORIZON ENVIRONMENT
研究了不允许缺货的单设施多产品生产计划模型，推导出规划时域定理，并据此开发了前向算法和滚动时域下首期生产选择程序，仿真实验证明其成本有效性。
ABSTRACT This paper considers a production planning model for a single‐facility multiproduct problem where backlogging is not allowed. A planning‐horizon theorem is derived. From that theorem, a forward algorithm for finding an optimal solution over a finite horizon and a procedure for selecting the first‐period production in a rolling‐horizon environment are developed. Computational results from a set of simulation experiments designed to investigate the cost effectiveness of the procedure demonstrate its effectiveness.