Static‐dynamic uncertainty strategy for a single‐item stochastic inventory control problem

We consider a single‐stage inventory system facing non‐stationary stochastic demand of the customers in a finite planning horizon. Motivated by the practice, the replenishment times need to be determined and frozen once and for all at the beginning of the horizon while decisions on the exact replenishment quantities can be deferred until the replenishment time. This operating scheme is refereed to as a ‘static‐dynamic uncertainty’ strategy in the literature . We consider dynamic fixed‐ordering and linear end‐of‐period holding costs, as well as dynamic penalty costs, or service levels. We prove that the optimal ordering policy is a base stock policy for both penalty cost and service level constrained models. Since an exponential exhaustive search based on dynamic programming yields the optimal ordering periods and the associated base stock levels, it is not possible to compute the optimal policy parameters for longer planning horizons. Thus, we develop two heuristics. Numerical experiments show that both heuristics perform well in terms of solution quality and scale‐up efficiently; hence, any practically relevant large instance can be solved in reasonable time. Finally, we discuss how our results and heuristics can be extended to handle capacity limitations and minimum order quantity considerations.