An Optimal Solution Algorithm for Joint Replenishment Problem with Piecewise Linear Warehousing Cost

摘要：

In the general lot sizing replenishment problem, warehousing costs are considered part of the inventory holding cost. When decision makers need warehouse space for the storage of their products, they generally take the warehousing cost into the inventory cost. In this study, we investigate an optimal lot sizing and replenishment problem under piecewise linear warehousing cost structure. In this study, we investigate an optimal lot sizing and replenishment problem under piecewise linear warehousing cost structure. We extend Goh et al. s (2001) study, and formulate a model for multiple stock-keeping units (Multi-SKUs) with joint inventory costs. To solve this problem. we conduct a full theoretical analysis on the optimality structure. By utilizing our theoretical results, we derive an effective search algorithm that is able to obtain an optimal solution for optimal lot sizing and replenishment problem under piecewise linear warehousing cost structure. Based on our randoM experiments, we demonstrate that our search algorithM out-performs Goh et al. s (2001).

关键词： Joint Replenishment Problem Warehouse Multi-SKUs Power-of-Two

作者: Jiayen Huang Mingjong Yao

作者单位: Department of Information Management, National Chin-Yi University of Technology, Taiping City, 41101 Department of Transportation Technology and Management, National Chiao Tung University,Hsinchu City,

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 722-727

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）