This paper aims to optimize the inventory replenishment policy in an integrated supply chain consisting of a single supplier and a single buyer. The system under consideration has the features such as backorders-lost sales mixture, controllable lead time, stochastic demand, and stockout costs. The underlying problem has not been studied in the literature. We present a novel approach to formulate the optimization problem, which is able to satisfy the constraint on the number of admissible stockouts per time unit. To solve the optimization problem, we propose two algorithms: an exact algorithm and a heuristic algorithm. These two algorithms are developed based on some analytical properties that we established by analysing the cost function in relation to the decision variables. The heuristic algorithm employs an approximation technique based on an ad-hoc Taylor series expansion. Extensive numerical experiments are provided to demonstrate the effectiveness of the proposed algorithms.
Optimizing Replenishment Policy in an Integrated Supply Chain with Controllable Lead Time and Backorders-Lost Sales Mixture
BRAGLIA Marcello;
2018-01-01
Abstract
This paper aims to optimize the inventory replenishment policy in an integrated supply chain consisting of a single supplier and a single buyer. The system under consideration has the features such as backorders-lost sales mixture, controllable lead time, stochastic demand, and stockout costs. The underlying problem has not been studied in the literature. We present a novel approach to formulate the optimization problem, which is able to satisfy the constraint on the number of admissible stockouts per time unit. To solve the optimization problem, we propose two algorithms: an exact algorithm and a heuristic algorithm. These two algorithms are developed based on some analytical properties that we established by analysing the cost function in relation to the decision variables. The heuristic algorithm employs an approximation technique based on an ad-hoc Taylor series expansion. Extensive numerical experiments are provided to demonstrate the effectiveness of the proposed algorithms.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


