2017年09月24日 |  English version
网站首页 | 学院一览 | 学院新闻 | 科学研究 | 学科建设 | 师资队伍 | 人才培养 | 学生工作 | 下载专区 | 招考信息
 
Optimal Inventory Policy for a Series Multi-echelon System with Deterministic Demand

题目:Optimal Inventory Policy for a Series Multi-echelon System with Deterministic Demand

报告人:李健(北京化工大学)

报告地点:行健楼学术报告室526

时间:2017822日下午4

摘要We consider the optimal policy for a series multi-echelon inventory system with deterministic demand. We design an algorithm based on a recursive relationship and two intuitive observations: namely piecewise convexity and local domination. Specifically, the algorithm recursively derives an optimal cost function with respect to the order interval of the top stage that is piecewise convex. Then it selects a sequence of local dominant policies, each of which has a unique local optimal solution. Finally, it finds the global optimal policy by emulating the local optimal policies. We demonstrate that the algorithm is efficient in terms of the average computing time. We also provide a heuristic that limits the number of local dominant policies in the search for the optimal solution, which yields a small error bound.

 返回
南京师范大学数学科学学院 版权所有 Copyright © 2009
通讯地址:南京市亚东新城区文苑路1号 南京师范大学数学科学学院 邮政编码:210023
联系电话:025-85898785