German inventory to sales ratios 1971-2005—An empirical analysis of business practice

The purpose of this study is to test empirically for the first time the general hypothesis that inventory to sales ratios have decreased over time in the German economy. Although inventory reduction has been a prevalent topic in the production and operations management literature, there is a lack of empirically confirmed answers to questions. They are as follows: Have inventories in German firms decreased overall during the past decades? What sectors of German industry are leading (lagging behind) inventory reduction? Has inventory reduction developed differently for raw materials, work-in-process, or finished goods? In which periods was marginal inventory reduction greatest? To the best of our knowledge, this empirical study is the first to broadly investigate inventory development from the 1970s until the present for a major European economy, Germany, and will provide the first answers to the research questions stated above using aggregate industry-level data provided by the Deutsche Bundesbank. We show that inventory levels decreased overall in many sectors of German industry. This reduction was mainly marked for raw materials and finished goods, particularly for the second-half of the time frame investigated.     

The MPS parameterization under lead time uncertainty

The supply planning of assembly systems under lead times uncertainty is studied. The used criteria is the sum of the average holding cost for the components, the average backlogging cost for the finished product, and the setup cost. The decision variables are the planned lead times of components and the periodic ordering quantity. A new generalized Newsboy model gives the optimal solution under the assumption that the lead times of the different types of components follow the same distribution probability, and that the holding costs per period of the ordered quantities are the same.     

An iterative approach to item-level tactical production and inventory planning

In this paper, we propose an iterative approach to jointly solve the problems of tactical safety stock placement and tactical production planning. These problems have traditionally been solved in isolation, even though both problems operate in the same decision making space and the outputs of one naturally serve as the inputs to the other. For simple supply chain network structures, two stages and one or many products, we provide sufficient conditions to guarantee the iteration algorithm’s termination. Through examples, we show how the algorithm works and prove its applicability on a realistic industrial-scale problem.     

A vendor managed inventory supply chain with deteriorating raw materials and products

Fast deteriorating raw materials such as raw milk, fruit and vegetables are commonly used to produce slowly deteriorating finished products such as milk powders, cheeses, and pastas. This paper studies a Vendor Managed Inventory (VMI) type supply chain where the manufacturing vendor decides how to manage the system-wide inventories of its fast deteriorating raw material and its slowly deteriorating product. The decision variables are a common replenishment cycle of the product and the replenishment frequency of the raw material. We assume the deteriorating rates are known constants and every retailer's demand is deterministic. We develop an integrated model to calculate the total inventory and deterioration cost for such a system. We prove the convexity of the cost functions, and based on this a golden search algorithm is developed to find the optimal solution of the model. Our numerical results show that the deteriorating rate of the product may increase the total cost by more than 40% compared to the zero-deteriorating rate, while the deteriorating raw material has less impact on the total cost (commonly less than 5% in our numerical examples). This indicates that more attention should be paid to the product than the raw material. Further, an increase in the number of retailers can make the replenishment frequency of the raw material increase significantly but the common replenishment cycle of the product decreases a little. This indicates that adding a new retailer would not be felt strongly by the other retailers but would be felt by the supplier of the raw material.     

An inventory control model with consideration of remanufacturing and product life cycle

This paper investigates inventory control policies in a manufacturing/remanufacturing system during the product life cycle, which consists of four phases: introduction, growth, maturity, and decline. Both demand rate and return rate of products are random variables with normal distribution; the mean of the distribution varies according to the time in the product life cycle. Closed-form formulas of optimal production lot size, reorder point, and safety stock in each phase of the product life cycle are derived. A numerical example is presented with sensitivity analysis. The result shows that different inventory control policies should be adopted in different phases of the product life cycle. It is also found that the optimal production lot size and reorder point are not sensitive to the phase length and the demand changing rate.     

An integrated production-distribution model for a deteriorating inventory item

We develop an integrated production-distribution model for a deteriorating item in a two-echelon supply chain. The supplier’s production batch size is restricted to an integer multiple of the discrete delivery lot quantity to the buyer. Exact cost functions for the supplier, the buyer and the entire supply chain are developed. These lead to the determination of individual optimal policies, as well as the optimal policy for the overall, integrated supply chain. We outline a procedure for determining the optimal supply chain decisions with the objective of minimizing the total system cost. Our approach is illustrated through a numerical example.     

A perishable inventory model with Markovian renewal demands

In the inventory model, people usually assume that the inter-demand time is independently identical distributed which may not be true in reality. Here we study an (s,S) continuous review model for items with an exponential random lifetime and a general Markovian renewal demand process. By constructing Markovian renewal equations, we derive the mean and the variance of the reorder cycle time and lead to a simple expression for the total expected long run cost rate. The numerical results illustrate the system behavior and lead to managerial insights into controlling such inventory systems.     

A serial mixed produce-to-order and produce-in-advance inventory model with multiple retailers

We formulate a general mixed produce-to-order and produce-in-advance inventory model having multiple stocking echelons and multiple retailers. We show that the problem to find an optimal inventory policy for such a model with a uniform or a normal demand distribution can be reduced to a general constrained optimization problem.     

Stochastic optimization for transshipment problems with positive replenishment lead times

Transshipments, monitored movements of material at the same echelon of a supply chain, represent an effective pooling mechanism. Earlier papers dealing with transshipments either do not incorporate replenishment lead times into their analysis, or only provide a heuristic algorithm where optimality cannot be guaranteed beyond settings with two locations. This paper uses infinitesimal perturbation analysis by combining with a stochastic approximation method to examine the multi-location transshipment problem with positive replenishment lead times. It demonstrates the computation of optimal base stock quantities through sample path optimization. From a methodological perspective, this paper deploys a duality-based gradient computation method to improve computational efficiency. From an application perspective, it solves transshipment problems with non-negligible replenishment lead times. A numerical study illustrates the performance of the proposed approach.     

Optimization of a vendor managed inventory supply chain with guaranteed stability and robustness

In this work we address the steady state optimization of a supply chain model that belongs to the class of vendor managed inventory, automatic pipeline, inventory and order based production control systems (VMI-APIOBPCS). The supply chain is optimized with the so-called normal vector method, which has specifically been developed for the economic optimization of uncertain dynamical systems with constraints on dynamics. We demonstrate that the normal vector method provides robust optimal points of operation for a number of scenarios. Since the method strictly distinguishes economic optimality, which is treated as the optimization objective, from dynamical requirements, which are incorporate by appropriate constraints, it provides a measure for the cost of stability and robustness as a desired side-effect.     

Inventory model for an inventory system with time-varying demand rate

The standard inventory problems of the multi-period have been modeled under different situations. Specifically we have considered the demand subjects of a continuous distribution and a discrete distribution, and whether the demand of each period is unchanged or not. A method to get an economic order quantity in inventory systems with discrete and unchanged demand was presented in a previous paper, and this method has been generalized to an inventory model with varying continuous demand. However, it was not achieved due to there being many classified cases in the general situations. In this article the above method is discussed in the case discrete demand to determine whether it increases or decreases from period to period. A theoretical method is presented by using previous results and some examples are given which suggest how the concept can handle on inventory system. In order to make the decision, an algorithm is also presented under some conditions, and examples are shown by using the computer software program, Mathematica, which helps to explain the findings. In general cases, we view the optimal policy in the inventory problems in only a few periods.     

An inventory reservation problem with nesting and fill rate-based performance measures

In many inventory settings companies wish to provide customer-differentiated service levels. These may, for example, be motivated by differences in the perceived customer lifetime value or by specific contractual agreements. One approach to provide differentiated service levels is to reserve some portion of the available inventory exclusively for specific customer classes. Existing approaches to inventory reservation are typically based on the assumption that a company can assign a customer specific revenue or penalty cost to any order or unit of demand filled or unfulfilled. In practice, however, it is usually extremely difficult to accurately estimate (especially long term) monetary implications of meeting or not meeting customer demand and corresponding service level requirements. The research presented in this paper addresses the problem of setting appropriate inventory reservations for different customer classes based on fill rate-based performance measures. We model a single period inventory reservation problem with two customer classes and nesting. We develop exact expressions for two conflicting performance measures: (1) the expected fill rate of high priority customers and (2) the expected loss in the system fill rate induced by inventory reservation. With these expressions a decision maker can analyze the tradeoff between the loss in overall system performance and the higher expected fill rates for prioritized customers. We provide analytical insights into the effects of nesting and the impact of relevant problem parameters on these two performance measures. The analytical insights are illustrated and highlighted through a set of numerical examples. Although we limit our analysis to a single period inventory reservation problem, we expect that our results can be utilized in a wide range of problem settings in which a decision maker has to ration a perishable resource among different classes of customers.     

Streamlining inventory flows with time discounts to improve the profits of a decentralized supply chain

We consider a decentralized supply chain, whereby a supplier sells a product to a group of independent buyers, and develop a strategy for the supplier to offer an all-units price discount or cash rebate for orders that are synchronized with its replenishments. As synchronized orders can be met with inventory directly from receiving to shipping without warehousing, the proposed strategy streamlines system inventory flows to minimize inventory and, hence, the related costs. On the other hand, by increasing the replenishment interval of the supplier, the proposed strategy is able to induce buyers to order in large quantities and hence achieve the objectives of quantity discounts. We show that the proposed strategy can achieve nearly optimal (minimum) system cost, and is much more effective than the existing coordination strategies for decentralized supply chains in the literature.     

An improved algorithm and solution on an integrated production-inventory model in a three-layer supply chain

Ben-Daya et al. (2010) established a joint economic lot-sizing problem (JELP) for a three-layer supply chain with one supplier, one manufacturer, and multiple retailers, and then proposed a heuristic algorithm to obtain the integral values of four discrete variables in the JELP. In this paper, we first complement some shortcomings in Ben-Daya et al. (2010), and then propose a simpler improved alternative algorithm to obtain the four integral decision variables. The proposed algorithm provides not only less CPU time but also less total cost to operate than the algorithm by Ben-Daya et al. (2010). Furthermore, our proposed algorithm can solve certain problems, which cannot be solved by theirs. Finally, the solution obtained by the proposed algorithm is indeed a global optimal solution in each of all instances tested.     

Lead time reduction strategies in a single-vendor-single-buyer integrated inventory model with lot size-dependent lead times and stochastic demand

This paper studies alternative methods for reducing lead time and their impact on the safety stock and the expected total costs of a (Q,s) continuous review inventory control system. We focus on a single-vendor-single-buyer integrated inventory model with stochastic demand and variable, lot size-dependent lead time and assume that lead time consists of production and setup and transportation time. As a consequence, lead time may be reduced by crashing setup and transportation time, by increasing the production rate, or by reducing the lot size. We illustrate the benefits of reducing lead time in numerical examples and show that lead time reduction is especially beneficial in case of high demand uncertainty. Further, our studies indicate that a mixture of setup time and production time reduction is appropriate to lower expected total costs.     

An inventory and order admission control policy for production systems with two customer classes

In this paper we examine a Markovian single-stage system producing a single item to satisfy demand of two different customer classes. A simple threshold type heuristic policy is proposed for the joint control of inventories and backorders. Explicit forms of the steady-state probabilities under this policy are derived and used to assess the average profit rate of the system and determine the optimal control parameters. Certain properties of the average profit rate are established and used to develop computationally efficient algorithms for finding the optimal control parameter values. Numerical results show that the proposed policy is a very good approximation of the optimal policy and outperforms other commonly used policies.     

An integrated production–distribution model for the dynamic location and allocation problem with safety stock optimization

The design and management of a multi-stage production–distribution system is one of the most critical problems in logistics and in facility management. Companies need to be able to evaluate and design different configurations for their logistic networks as quickly as possible. This means coordinating the entire supply chain effectively in order to minimize costs and simultaneously optimize facilities location, the allocation of customer demand to production/distribution centers, the inbound and outbound transportation activities, the product flows between production and/or warehousing facilities, the reverse logistics activities, etc.Full optimization of supply chain is achieved by integrating strategic, tactical, and operational decision-making in terms of the design, management, and control of activities. The cost-based and mixed-integer programming model presented in this study has been developed to support management in making the following decisions: the number of facilities (e.g. warehousing systems, distribution centers), the choice of their locations and the assignment of customer demand to them, and also incorporate tactical decisions regarding inventory control, production rates, and service-level determination in a stochastic environment. This paper presents an original model for the dynamic location–allocation problem with control of customer service level and safety stock optimization. An experimental analysis identifies the most critical factors affecting the logistics cost, and to finish, an industrial application is illustrated demonstrating the effectiveness of the proposed optimization approach.