启发式
持有成本
数学优化
计算机科学
时间范围
单调函数
销售损失
维数(图论)
平均成本
灵敏度(控制系统)
运筹学
经济
数学
微观经济学
纯数学
工程类
电子工程
数学分析
作者
Shouchang Chen,Yanzhi Li,Yi Yang,Weihua Zhou
摘要
We consider a periodic‐review perishable inventory system with multiple demand classes, each characterized by a different lost‐sales cost and the least freshness requirement. Demands of different classes in the same period could be correlated, while demands across periods are independent but not necessarily identical. In each period, the firm jointly makes the decisions regarding demand fulfillment, production/ordering, and disposal. The objective is to minimize the total discounted expected cost over the entire planning horizon including linear ordering cost, inventory holding/lost‐sales cost, expiration cost, and disposal cost. By establishing new properties of multimodularity, we explore some monotonicity and bounded sensitivity properties of the optimal policies. The optimality analysis enables us to propose a novel approximation approach, called adaptive approximation approach, which can be recursively calculated through a single‐dimension dynamic program. Numerical studies demonstrate that our proposed approximation approach is nearly optimal with the average optimality gap 0.30% and significantly outperforms the existing heuristics in the literature.
科研通智能强力驱动
Strongly Powered by AbleSci AI