论文部分内容阅读
考虑在多类顾客需求环境下有限计划期内的动态批量补货问题。在一般的补货成本结构下,每类顾客的最优补货期各不相同,且该补货问题为NP难题。考虑在没有投机行为的补货成本结构下,最优的补货策略满足“零库存补货”规则,且在每类顾客在补货周期内存在一个最优的及时服务临界期,临界期之前的需求将得到及时满足,临界期后的需求将被缺货处理。基于最优的临界期库存分配策略,提出一个多项式算法得到最优的补货策略。与先到先服务的需求服务策略进行比较,数例分析得到临界期库存分配策略可以大幅提高整个计划期的利润。最后,在一般的补货成本结构下,考虑一种特殊发货规则,提出一种有效的启发式算法,优化每类顾客的最优补货期。
Consider the dynamic batch replenishment problem within a limited planning period in a variety of customer needs. Under the general replenishment cost structure, the optimum replenishment period varies for each type of customer, and the replenishment problem is NP difficult. Considering that under the replenishment cost structure without speculation, the optimal replenishment strategy satisfies “zero stock replenishment ” rule, and there is an optimal critical stage of timely replenishment for each type of customer in the replenishment cycle. The critical The demand before the period will be satisfied in time, and the demand after the critical period will be dealt with out of stock. Based on the optimal critical period inventory allocation strategy, a polynomial algorithm is proposed to get the optimal replenishment strategy. Compared with the first-come, first-serve demand service strategy, the analysis of the critical period inventory distribution strategy can greatly improve the profit of the entire planning period. Finally, under the general replenishment cost structure, we consider a special shipping rule and propose an effective heuristic algorithm to optimize the optimal replenishment period for each type of customer.