期刊文献+

库存能力有限的再制造批量决策 被引量:9

Decision for Lot Sizing Problem with Remanufacturing and Bounded Inventory
下载PDF
导出
摘要 从能力有限的动态批量问题出现开始,国内外众多学者全心致力于这类问题的研究。随着环境问题在制造业企业生产过程中的日益突出,资源回收与再制造成为了许多企业关注的热点。为了充分考虑实际生产的需要,本文在Richter再制造模型的基础上,引入库存能力约束,利用动态规划方法给出一个多项式算法来求解终产品库存能力受限问题和退回产品库存能力受限问题,并分别用一个模拟算例验证了算法的可行性。 This paper addresses the dynamic lot sizing problem for systems with bounded inventory and remanufacturing. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied not only by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Only a few studies can be found in the literature for this situation, and among them remanufacturing is not usually. In this paper, we consider the lot sizing problem bounded inventory and remanufacturing. The objective is to determine those lot sizes for manufacturing and remanufacturing that minimize the total cost composed of holding cost for returns and (re) manufactured products and setup costs. The joint setup cost for manufacturing and remanufacturing i.e. a single production line is considered. Two different limited inventory capacity are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present an exact, polynomial time dynamic programming algorithm.
出处 《运筹与管理》 CSCD 2008年第3期7-15,共9页 Operations Research and Management Science
基金 国家自然科学基金项目(70602017) 国家社科基金项目(06CJY019) 国家自然科学基金重点项目(70433003)资助
关键词 批量决策 再制造 库存能力受限 多项式算法 lot sizing remanufacturing bounded inventory polynomial algorithm
  • 相关文献

参考文献13

  • 1Harris F. How many parts to make at once[J]. The Magazine of Management, 1913, 10(2) : 135-136.
  • 2Wanger H, Whitin T. Dynamic version of the economic lot size model[ J]. Management Science, 1959, 5 (1) : 89-96.
  • 3Folrian M, Klein M. Deterministic production planning with concave costs and capacity constraints[ J]. Management Science, 1971, 18(1): 12-20.
  • 4Love S F. Bounded production and inventory models with piecewise concave costs[ J]. Management Science, 1973 20 (3) : 313-318.
  • 5Baker K B, et al. An algorithm for the dynamic lot-slze problem with tlme-varylng production capacity constraints[ J]. Management Science, 1978, 24(16): 1710-1720.
  • 6Bitran G R, Yanasse H H. Computational complexity of the capacitated lot size problem[ J]. Management Science, 1982,28 (10) : 1174-1186.
  • 7Bitran G R, Matsuo H. Approximation formulations for the single-product capacitated lot size problem[ J]. Operations Research, 1986, 34( 1 ) : 63-74.
  • 8Chung C S, Lin C H M. An algorithm for the NI/G/NI/ND capacitated lot size problem[J]. Management Science, 1988, 3: 420-425.
  • 9Gutiettez J, et al. A new characterization for the dynamic lot size problem with bounded inventory[ J].Computers and Operations Research, 2002, 30: 383-395.
  • 10Richter K, Sombrutzki M. Remanufacturing planning for the reverse Wagner/Whitin models[ J]. European Journal of Operational Research, 2000, 121 :304-315.

同被引文献157

引证文献9

二级引证文献40

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部