ABC Classification: Service Levels and Inventory Costs

ABC inventory classifications are widely used in practice, with demand value and demand volume as the most common ranking criteria. The standard approach in ABC applications is to set the same service level for all stock keeping units (SKUs) in a class. In this paper, we show (for three large real life datasets) that the application of both demand value and demand volume as ABC ranking criteria, with fixed service levels per class, leads to solutions that are far from cost optimal. An alternative criterion proposed by Zhang et al. performs much better, but is still considerably outperformed by a new criterion proposed in this paper. The new criterion is also more general in that it can take criticality of SKUs into account. Managerial insights are obtained into what class should have the highest/lowest service level, a topic that has been disputed in the literature.     

Impact of temporal aggregation on stock control performance of intermittent demand estimators: Empirical analysis

Intermittent demand is characterized by occasional demand arrivals interspersed by time intervals during which no demand occurs. These demand patterns pose considerable difficulties in terms of forecasting and stock control due to their compound nature, which implies variability both in terms of demand arrivals and demand sizes. An intuitively appealing strategy to deal with such patterns from a forecasting and stock control perspective is to aggregate demand in lower-frequency ‘time buckets’, thereby reducing the presence of zero observations. In this paper, we investigate the impact of forecasting aggregation on the stock control performance of intermittent demand patterns. The benefit of the forecasting aggregation approach is empirically assessed by means of analysis on a large demand dataset from the Royal Air Force (UK). The results show that the aggregation forecasting approach results in higher achieved service levels as compared to the classical forecasting approach. Moreover, when the combined service-cost performance is considered, the results also show that the former approach is more efficient than the latter, especially for high target service levels.     

Inventory routing problems in a context of vendor-managed inventory system with consignment stock and transshipment

The inventory routing problem involves the integration and the coordination of two components of the logistics value chain: the inventory management and the vehicle routing decisions. In fact, the aim is to jointly decide on the distribution tour, from a distribution centre to a set of locations, and on the inventory policy for each location. Although many research investigations show great interest in policies such as transshipment or dynamic routings on the distribution system performances, these approaches are often criticised in practice as being too restrictive. In this article, we consider the inventory routing framework in a supplier integration context, i.e. a vendor-managed inventory with a consignment stock policy. Under such framework, we show that the transshipment brings more benefits than the classical context. In particular, we consider the case of static routings and we numerically show that transshipment permits to better optimise the distribution tours and to improve the global performance of the supply network.     

Coalition Formation and Cost Allocation for Joint Replenishment Systems

This paper focuses on the issues of coalition formation and cost allocation in a joint replenishment system involving a set of independent and freely interacting retailers purchasing an item from one supplier to meet a deterministic demand. The papers dealing with this problem are mainly focused on supperadditive games, where the cost savings associated with a coalition increase with the number of players in the coalition. The most relevant question addressed then is how to allocate the savings to the players. In this paper, we propose to go further by dealing with a non‐supperadditive game, where a set of independent retailers have the common understanding to share the cost savings according to the cost‐based proportional rule. In this setting, the global cost optimization is no longer a relevant approach to identify appealing coalitions for any retailer. Here, we provide an iterative procedure to form the so‐called efficient coalition structure and we show that this coalition structure has the nice properties of being (i) weakly stable in the sense of the coalition structure core and (ii) strongly stable under a given assumption. An exact fractional programming based solution is also given to generate such efficient coalitions.