A combinatorial optimisation approach for closed-loop supply chain inventory planning with deterministic demand

Supply chains in equipment-intensive service industries often involve repair operations. In this context, tactical inventory planning is concerned with optimally planning supplies and repairs based on demand forecasts and in the face of conflicting business objectives. This paper considers closed-loop supply chains and proposes a mixed-integer programming model and a metaheuristic approach to this problem. The model is open to a variety of network topologies, site functions and transfer policies. It also accommodates multiple objectives by the means of a weighted cost function. We report experiments on pseudo-random instances designed to evaluate plan quality and impact of cost weightings. In particular, we show how appropriate weightings allow to implement common planning strategies e.g. just-in-time replenishment, minimal repair).