Title of article
Optimal policy for a dynamic, non-stationary, stochastic inventory problem with capacity commitment
Author/Authors
Ningxiong Xu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
9
From page
400
To page
408
Abstract
This paper studies a single-product, dynamic, non-stationary, stochastic inventory problem with capacity commitment, in which a buyer purchases a fixed capacity from a supplier at the beginning of a planning horizon and the buyer’s total cumulative order quantity over the planning horizon is constrained with the capacity. The objective of the buyer is to choose the capacity at the beginning of the planning horizon and the order quantity in each period to minimize the expected total cost over the planning horizon. We characterize the structure of the minimum sum of the expected ordering, storage and shortage costs in a period and thereafter and the optimal ordering policy for a given capacity. Based on the structure, we identify conditions under which a myopic ordering policy is optimal and derive an equation for the optimal capacity commitment. We then use the optimal capacity and the myopic ordering policy to evaluate the effect of the various parameters on the minimum expected total cost over the planning horizon.
Keywords
Myopic policy , stochastic dynamic programming , Additive function , Capacity , Inventory
Journal title
European Journal of Operational Research
Serial Year
2009
Journal title
European Journal of Operational Research
Record number
1314009
Link To Document