Order quantities for perishable inventory control with non-stationary demand and a fill rate constraint

We model this decision problem as a Stochastic Programming (SP) model. The objective of our study is to find order quantities for the SP model, that approximately meet cycle fill rate service level requirements while keeping outdating low. To find approximate solutions for the SP model, an MILP model is developed. The MILP model is a deterministic approximation that generates feasible replenishment quantities in less than a second. With a scenario-based MINLP approach, optimal solutions are generated for a large sample of demand paths as a benchmark for the MILP solutions. We show that the MILP model is suitable for practical use if the setup cost is such that the replenishment cycles in the production plan are close to or of the same length as the maximum shelf life. In those cases, the expected total costs are close to the costs of the optimal solution and the average fill rate is close to the required one.