A Study of Dynamic Lot-sizing Inventory Problem with Lost-sale

• Main Authors: Zi-YiShen, 沈姿儀
• Other Authors: Shine-Der Lee
• Format: Others
• Language: zh-TW
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/24142276595104371921

碩士 === 國立成功大學 === 工業與資訊管理學系 === 103 === A dynamic lot-sizing inventory problem with lost-sale is addressed in this thesis. Demand is satisfied from on-hand stock until it is depleted and unsatisfied demand is lost without replenishment. For a given stream of demand data in finite periods, the objective is to determine the optimal replenishment policy which minimizes the total relevant cost, including setup cost, unit variable cost, inventory holding cost, and lost-sale cost, where the cost parameters may vary over the planning horizon. The described dynamic control problem is different from those in the literature, where on-hand inventory can be reserved to satisfy future demand, instead of meet current demand. The dynamic inventory problem is formulated as a dynamic programming model. Four dominance properties are established, and are used to develop an efficient dynamic programming algorithm, which runs in polynomial time O(n^2), where n is the number of planning periods in the dynamic inventory problem. Computational experiments have shown that the developed dynamic programming algorithm is very efficient, i.e., less than 1 second for solving problems with planning periods up to 100. The performance of the solution procedure is also very consistent, regardless of changes of a variety of parameters.