期刊文献+

Dynamic programming algorithm for economic lot-sizing problem with bounded inventory and out-sourcing

Dynamic programming algorithm for economic lot-sizing problem with bounded inventory and out-sourcing
下载PDF
导出
摘要 This paper addresses a single item dynamic lot-sizing model with inventory capacity and out-sourcing. The goal is to minimize the total costs of production, setup, inventory holding and out-sourcing. Two versions of an out-sourcing model with time-varying costs are considered: stock out case and conservation case. Zero Inventory Order property has been found and some new properties are obtained in an optimal solution. Dynamic programming algorithms are developed to solve the problem in strongly polynomial time respectively. Furthermore, some numerical results demonstrate that the approach proposed is efficient and applicable. This paper addresses a single item dynamic lot-sizing model with inventory capacity and out-sourcing. The goal is to minimize the total costs of production, setup, inventory holding and out-sourcing. Two versions of an out-sourcing model with time-varying costs are considered: stock out case and conservation case. Zero Inventory Order property has been found and some new properties are obtained in an optimal solution. Dynamic programming algorithms are developed to solve the problem in strongly polynomial time respectively. Furthermore, some numerical results demonstrate that the approach proposed is efficient and applicable.
作者 刘晓 王成恩
出处 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2005年第4期450-455,共6页 哈尔滨工业大学学报(英文版)
基金 SponsoredbytheNationalNaturalScienceFoundationofChina(GrantNo.79931000andNo.70271049).
关键词 lot sizing dynamitic programming out-sourcing INVENTORY 动态规划 有限库存 动态批量问题 遗传算法
  • 相关文献

参考文献11

  • 1Hsin-Der Chen,Donald W. Hearn,Chung-Yee Lee.A new dynamic programming algorithm for the single item capacitated dynamic lot size model[J].Journal of Global Optimization.1994(3)
  • 2VAN HOESEL C P M,WAGELMANS A P M.An O (T3 ) algorithm for the econom ic lot-sizing problem with constant capacities[].Management Science.1996
  • 3AGGARWAL A,PARK J K.Improved algorithms for econom ic lot-size problems[].Operations Research.1993
  • 4SWOVELAND C.A determ inistic multi-period production planning model with piecewise concave production and holding-backorder costs[].Management Science.1975
  • 5W agelmans,VAN HOESEL A S,KOLEN A.Econom ic lot-sizing: An O (n log n) algorithm that runs in linear time in the wagner-whitin case[].Operations Research.1992
  • 6CHEN H D,LEE H C Y.A new dynam ic programm ing algorithm for the single item capacitated dynam ic lot size model[].J G lobal Optim.1994
  • 7FLOR IAN M,KLEIN M.Determ inistic production planning with concave costs and capacity constraints[].Management Science.1971
  • 8WAGNER HM,WHITIN T.Dynam ic version of the econom ic lot size model[].Management Science.1958
  • 9GUTIERREZ J,SEDENO-NODA A,COLEBROOK M,et al.A new characterization for the dynam ic lot size problem with bounded inventory[].Computers and Operations Research.2002
  • 10FEDERGRUEN,TZUR M.A single forward algorithm to solve general dynam ic lot sizing models with nperiods in O (n log n) or O (n) time[].Management Science.1991

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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