SearcharxivSearch

arXiv subjects

Mirjam S. Meijer

Publications and source records attributed to Mirjam S. Meijer.

2 recordsLinked to original sources

Fixed non-stockout-probability policies for the single-item lost-sales model

We consider the classical discrete time lost-sales model under stationary continuous demand and linear holding and penalty costs and positive constant lead time. To date the optimal policy structure is only known implicitly by solving numerically the Bellman equations. In this paper we derive an optimality equation for the lost-sales model. We propose a fixed non-stockout-probability (FP3) policy, implying that each period the order size ensures that P3, the probability of no-stockout at the end of the period of arrival of this order, equals some target value. The FP3-policy can be computed efficiently and accurately from an exact recursive expression and two-moment fits to the emerging random variables. We use the lost-sales optimality equation to compute the optimal FP3-policy. Comparison against the optimal policy for discrete demand suggests that the fixed P3-policy is close-to-optimal. An extensive numerical experiment shows that the FP3-policy outperforms other policies proposed in literature in 97% of all cases. Under the FP3-policy, the volatility of the replenishment process, measured as coefficient of variation (cv) is much lower than the volatility of the demand process. This cv-reduction holds a promise for substantial cost reduction at upstream stages in the supply chain of the end-item under consideration, compared to the situation with backlogging.

math.OC

Optimization of inventory and capacity in large-scale assembly systems using extreme-value theory

High-tech systems are typically produced in two stages: 1) Production of components using specialized equipment and staff; 2) System assembly/integration. Component production capacity is subject to fluctuations, causing a high risk of shortages of at least one component, which results in costly delays. Companies hedge this risk by strategic investments in excess production capacity and in buffer inventories of components. To optimize these, it is crucial to characterize the relation between component shortage risk and capacity and inventory investments. We suppose that component production capacity and produce demand are normally distributed over finite time intervals, and we accordingly model the production system as a symmetric fork-join queueing network with $N$ statistically identical queues with a common arrival process and independent service processes. Assuming a symmetric cost structure, we subsequently apply extreme value theory to gain analytic insights into this optimization problem. We derive several new results for this queueing network, notably that the scaled maximum of $N$ steady-state queue lengths converges in distribution to a Gaussian random variable. These results translate into asymptotically optimal methods to dimension the system. Tests on a range of problems reveal that these methods typically work well for systems of moderate size.

math.PR