|
|||||
|
|
| 二供应商经济批量问题的多项式时间算法 | |
| 引用本文： | 徐健腾,柏庆国,张庆普.二供应商经济批量问题的多项式时间算法[J].系统科学与数学,2010,30(7):936-946. |
| 作者姓名： | 徐健腾 柏庆国 张庆普 |
| 作者单位： | 1. 曲阜师范大学运筹与管理学院,山东,276826;哈尔滨工业大学管理学院,黑龙江,150001 2. 曲阜师范大学运筹与管理学院,山东,276826 3. 哈尔滨工业大学管理学院,黑龙江,150001 |
| 摘 要： | 为了从采购费用结构不同的供应商中找到最佳补货策略,考虑一个零售商从两个供应商补货的二供应商经济批量问题.零售商在两个供应商处的采购费用结构分别为复合安装费用和全单位数量折扣费用结构.通过对问题结构性质的分析论证,将问题的可行解转化为一个有向网络,降低问题求解的计算复杂性.综合动态规划和Dijkstra最短路算法证明了该问题是多项式时间可解的. |
| 关 键 词： | 批量 复合安装费用 全单位数量折扣 计算复杂性 动态规划. |
| 收稿时间： | 2008-3-31 |
| 修稿时间： | 2010-3-9 |
A POLYNOMIAL TIME ALGORITHM FOR TWO-SUPPLIER ECONOMIC LOT-SIZE PROBLEM |
|
| XU Jianteng,BAI Qingguo,ZHANG Qingpu.A POLYNOMIAL TIME ALGORITHM FOR TWO-SUPPLIER ECONOMIC LOT-SIZE PROBLEM[J].Journal of Systems Science and Mathematical Sciences,2010,30(7):936-946. | |
| Authors: | XU Jianteng BAI Qingguo ZHANG Qingpu |
| Institution: | (1)School of Operations Research and Management, Qufu Normal University, 276826; School of Management, Harbin Institute of Technology, 150001;(2)School of Operations Research and Management, Qufu Normal University, 276826;(3)School of Management, Harbin Institute of Technology, 150001 |
| Abstract: | 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. |
| Keywords: | Lot-size multiple set-ups cost all-unit quantity discount computational complexity dynamic programming |
| 本文献已被 万方数据 等数据库收录！ | |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 | |
| 点击此处可从《系统科学与数学》下载免费的PDF全文 | |