%0 Journal Article
%T A POLYNOMIAL TIME ALGORITHM FOR TWO-SUPPLIER ECONOMIC LOT-SIZE PROBLEM<br>二供应商经济批量问题的多项式时间算法
%A XU Jianteng
%A BAI Qingguo
%A ZHANG Qingpu
%A <br>徐健腾
%A 柏庆国
%A 张庆普
%J 系统科学与数学
%D 2010
%I 
%X In order to find the optimal replenishment policy from the suppliers with different structures, this paper considers the two-supplier economic lot-size problem in which the retailer replenishes products from two suppliers. The two suppliers are characterized by multiple set-ups and all-unit quantity discount cost structures. Some structure properties are proposed to reduce the computational complexity. Then the feasible solutions of the problem are converted into a directed network. It is proved that this two-supplier economic lot-size problem can be solved in polynomial time by integrated dynamic programming and Dijkstra's shortest-path algorithm.
%K Lot-size
%K multiple set-ups cost
%K all-unit quantity discount
%K computational complexity
%K dynamic programming<br>批量
%K 复合安装费用
%K 全单位数量折扣
%K 计算复杂性
%K 动态规划.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=ABBD9B1FDA29D9A2819532319DCA243C&yid=140ECF96957D60B2&vid=340AC2BF8E7AB4FD&iid=DF92D298D3FF1E6E&sid=66973F362693F62B&eid=7C8C2BAFC9BA0571&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=12