检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输学院,四川成都610031 [2]昆明理工大学交通工程学院,云南昆明650093
出 处:《西南交通大学学报》2004年第4期535-539,共5页Journal of Southwest Jiaotong University
摘 要:针对供应商提供数量折扣、需求率随时间变化、周期性检查并补充库存的多阶段库存控制策略,提出一种优化算法.该算法以各时段的累计需求为根节点建立搜索树,从而将带折扣的库存问题转化为典型的动态批量问题,运用动态规划法即可求解.利用该算法可以找出在计划时段内总成本最小的补充策略.用算例说明了该算法的有效性.To optimize milti-period inventory systems, in which quantity discounts are available, demand rates change over time, and checking and replenishments are made periodically, an algorithm was proposed to search control rules. In the algorithm, a search tree with roots of the cumulative demands in the corresponding period is taken as the roots of the search tree, transforming the quantity discount problem into dynamic order quantity (DOQ) problem that is solvable with a dynamic programming algorithm. The proposed algorithm is capable to search the supplemental policy to minimize the cost of the concerned period. The validity of the algorithm was illustrated with an example.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36