A coordination mechanism with fair cost allocation for divergent multi-echelon inventory systems

In this paper we study the coordination of inventory control in divergent multi-echelon inventory systems under periodic review and decentralized control. Under decentralized control the installations decide upon replenishment policies that minimize their individual inventory costs. In general these policies do not coincide with the optimal policies of the system under centralized control. Hence, the total cost under decentralized control is larger than under centralized control. We present a simple coordination mechanism that removes this cost inefficiency. The upstream installations increases its base stock level while the downstream installations compensate their supplier for increased costs and provide it with additional side payments. We show that this mechanism coordinates the system; the global optimal policy of the system is the unique Nash equilibrium of the corresponding strategic game. Furthermore, the mechanism results in a fair allocation of the costs; all installations enjoy cost savings.     

Centralization versus decentralization: Risk pooling,risk diversification,and supply chain disruptions

We investigate optimal system design in a multi-location system in which supply is subject to disruptions. We examine the expected costs and cost variances of the system in both a centralized and a decentralized inventory system. We show that, when demand is deterministic and supply may be disrupted, using a decentralized inventory design reduces cost variance through the risk diversification effect, and therefore a decentralized inventory system is optimal. This is in contrast to the classical result that when supply is deterministic and demand is stochastic, centralization is optimal due to the risk-pooling effect. When both supply may be disrupted and demand is stochastic, we demonstrate that a risk-averse firm should typically choose a decentralized inventory system design.     

Multiple In‐Cycle Transshipments with Positive Delivery Times

We study a centralized inventory sharing system of two retailers that are replenished periodically. Between two replenishments, a unit can be transshipped to a stocked‐out retailer from the other. It arrives a transshipment time later, during which the stocked‐out retailer incurs backorder cost. Without transshipment, backorder cost is incurred until the next replenishment. Since the transshipment time is shorter than the time between two replenishments, transshipments can reduce the backorder cost at the stocked‐out retailer and the holding costs at the other retailer. The system is directed by a centralized inventory manager, who minimizes the long‐run average cost consisting of replenishment, holding, backorder, and transshipment costs. The transshipment policy is characterized by hold‐back inventory levels, which are nonincreasing in the remaining time until the next replenishment. The transshipment policy differs from those in the literature because we allow for multiple transshipments between replenishments, positive transshipment times, and backorder costs. We also discuss the challenges associated with positive replenishment time and develop upper and lower bounds of average cost in this case. Bounds are numerically shown to have an average gap of 1.1%. A heuristic solution is based on the upper bound and differs from the optimal cost by at most this gap.     

The disassembly line: balancing and modeling,by S.M. McGovern and S.M. Gupta

This note addresses a problem faced by an actual firm. The problem is to decide on the optimal level of product quality. In performing the economic analysis to determine product quality level, the firm considers revenue, production costs, and research and development costs. However, this note shows that ignoring inventory costs in the analysis will lead to suboptimal product quality levels. Also, including inventory costs in the analysis will lead to reduced production lot sizes. Numerical examples are used to illustrate the results of the model.     

物流联合外包下库存管理模式对供应链运作的影响

针对由供应商、第三方物流服务商和零售商组成的供应链,考虑供需双方将物流服务联合外包给第三方物流服务商、共同承担运费的情形,探究供应商管理库存和寄售库存两类库存管理模式的引入对供应链运作及合同设计的影响。分别在传统的零售商管理库存、仅引入寄售库存的零售商管理寄售库存以及同时引入供应商管理库存和寄售库存的供应商管理寄售库存三种模式下,构建了第三方物流服务商主导、供应商和零售商跟随的序贯非合作博弈模型,证明了所有模式下均衡的订购量/寄售量均存在且唯一,并探讨了均衡结果随零售商运费分摊比例、转移支付价格两个关键参数的变化。横向对比三种模式下的均衡结果和集中决策下的最优结果,发现：零售商管理库存模式下的均衡订购量总是低于零售商管理寄售库存模式以及集中决策下的结果,而其他库存管理模式下的订购量并非一定低于集中决策下的结果;不同库存管理模式下,均衡状态下的订购量/寄售量及供应链总的期望收益大小关系取决于供应商和零售商的类边际(毛利)贡献率,从而表明,供应链环境下,上下游成员企业的收益结构、盈利水平等对于库存决策及库存模式的选取有重要影响。此外,在绝大多数情形下,不同库存管理模式下的均衡订购量与集中决...     

A Heuristic Algorithm for the Capacitated Multiple Supplier Inventory Grouping Problem

This paper presents and solves a model for the multiple supplier inventory grouping problem, which involves the minimization of logistics costs for a firm that has multiple suppliers with capacity limitations. The costs included in the model are purchasing, transportation, ordering, and inventory holding, while the firm's objective is to determine the optimal flows and groups of commodities from each supplier. We present an algorithm, which combines subgradient optimization and a primal heuristic, to quickly solve the multiple supplier inventory grouping problem. Our algorithm is tested extensively on problems of various sizes and structures, and its performance is compared to that of OSL, a state-of-the-art integer programming code. The computational results indicate that our approach is extremely efficient for solving the multiple supplier inventory grouping problem.     

Optimum common cycle for scheduling a single-machine multiproduct system with a budgetary constraint

This paper deals with the single machine multi-product lot size scheduling problem, and has two objectives. The first objective is to minimize the maximum aggregate inventory for the common cycle (CC) scheduling policy. A simple and easy-to-apply rule has been developed which determines the optimal production sequence that achieves this objective. The second objective is to find an optimal common cycle for minimizing the average production and inventory costs per unit time, subject to a given budgetary constraint. A method has been presented that achieves this objective     

A competitive multiple-product newsboy problem with partial product substitution

This paper studies a multi-product competitive newsboy problem with shortage penalty cost and partial product substitution. We characterize the unique Nash equilibrium of the competitive model and analyze some properties of the equilibrium. An iterative algorithm is developed on the basis of approximating the effective demand as well as the expected profit function for each product. Numerical experiments are conducted to illustrate the impacts of product substitution, demand correlation and demand variation on the optimal order quantities and the corresponding expected profits, and to compare the total optimal inventory level of the competitive case with that of the centralized case. The conclusion that competition always results in a higher total inventory level, even under the effect of product substitution is drawn in the symmetric case.     

Cost and Shortage Trade-Offs in Aggregate Production Planning*

It is exceedingly difficult, if not impossible, to measure shortage costs. To bypass this difficulty in aggregate production planning, this paper develops an optimal policy function (piecewise linear or a curve) for trade-offs between shortages and the sum of production and inventory costs. The optimal management decision is based on this function. It should be of major interest in production planning since similar functions for inventory management have been successfully applied in practice.     

A Bayesian Inventory Model Using Real‐Time Condition Monitoring Information

Lack of coordination between machinery fault diagnosis and inventory management for spare parts can lead to increased inventory costs and disruptions in production activity. We develop a framework for incorporating real‐time condition monitoring information into inventory decisions for spare parts. We consider a manufacturer who periodically replenishes inventory for a machine part that is subject to deterioration. The deterioration is captured via condition monitoring and modeled using a Wiener process. The resulting degradation model is used to derive the life distribution of a functioning part and to estimate the demand distribution for spare parts. This estimation is periodically updated, in a Bayesian manner, as additional information on part deterioration is obtained. We develop an inventory model that incorporates this updated demand distribution and demonstrate that a dynamic base‐stock policy, in which the optimal base‐stock level is a function of some subset of the observed condition monitoring information, is optimal. We propose a myopic critical fractile policy that captures the essence of the optimal policy, but is easier to compute. Computational experiments indicate that this heuristic performs quite well relative to the optimal policy. Adaptive inventory policies such as these can help manufacturers to increase machine availability and reduce inventory costs.     

Inventory Rationing for Multiple Class Demand under Continuous Review

We consider how a firm should ration inventory to multiple classes in a stochastic demand environment with partial, class‐dependent backlogging where the firm incurs a fixed setup cost when ordering from its supplier. We present an infinite‐horizon, average cost criterion Markov decision problem formulation for the case with zero lead times. We provide an algorithm that determines the optimal rationing policy, and show how to find the optimal base‐stock reorder policy. Numerical studies indicate that the optimal policy is similar to that given by the equivalent deterministic problem and relies on tracking both the current inventory and the rate that backorder costs are accumulating. Our study of the case of non‐zero lead time shows that a heuristic combining the optimal, zero lead time policy with an allocation policy based on a single‐period profit management problem is effective.     

Dynamic Pricing and Inventory Management with Dual Suppliers of Different Lead Times and Disruption Risks

It is common for a firm to make use of multiple suppliers of different delivery lead times, reliabilities, and costs. In this study, we are concerned with the joint pricing and inventory control problem for such a firm that has a quick‐response supplier and a regular supplier that both suffer random disruptions, and faces price‐sensitive random demands. We aim at characterizing the optimal ordering and pricing policies in each period over a planning horizon, and analyzing the impacts of supply source diversification. We show that, when both suppliers are unreliable, the optimal inventory policy in each period is a reorder point policy and the optimal price is decreasing in the starting inventory level in that period. In addition, we show that having supply source diversification or higher supplier reliability increases the firm's optimal profit and lowers the optimal selling price. We also demonstrate that, with the selling price as a decision, a supplier may receive even more orders from the firm after an additional supplier is introduced. For the special case where the quick‐response supplier is perfectly reliable, we further show that the optimal inventory policy is of a base‐stock type and the optimal pricing policy is a list‐price policy with markdowns.     

Impact of Retailers with Knowledge of Supplier's Inventory on Supply Chain Performance

We model a supply chain consisting of a supplier and multiple retailers facing deterministic demand. We denote some retailers as strategic in the sense that given the supplier inventory information, they will implement the optimal stocking policy by incorporating such information. On the other hand, some retailers are denoted as naïve in the sense that they ignore supply information and resort to a simplistic ordering policy. Naïve retailers learn the optimal policy over time and adjust their orders accordingly. We study the dynamics of this game and investigate the impact of such strategic and naïve retailers on the cost, ordering pattern and stocking policies of all parties. We analyze the supply chain under two scenarios: the centralized supply chain where the objective is to minimize the total supply chain cost, and the decentralized supply chain where each self‐interested player minimizes its own cost in a Stackelberg game setting. We fully characterize the optimal policies under both centralized and decentralized scenarios and show that, surprisingly, the supply chain might be better off by virtue of naïve retailers. The result is driven by the fact that strategic and naïve players’ decisions shift the positioning of inventory in the supply chain with its final impact being determined by the relative costs of different retailer‐types. Our results also offer managerial insights into how access to supply information can improve supply chain performance.     

INVENTORY MANAGEMENT AND CAPITAL BUDGETING: A PEDAGOGICAL NOTE

This paper shows, through an alternative development of the lot size model, how the methods of capital budgeting can be logically applied to the determination of optimal inventory levels. There is no reason why inventory management needs be treated any differently than the management of fixed assets. The rule that the stock of fixed assets should be expanded until the marginal rate of return equals the marginal cost of capital results from maximizing the present value of profits as a function of the investment level. In a like manner, the “square root” formula from inventory theory results from maximizing the present value of profits as a function of the investment in inventory. In addition, formulating the inventory problem as a capital budgeting problem has advantages for incorporating deterioration, obsolescence, and other costs into the model in a more logical and less intuitive way.     

STOCK LEVELS AND DELIVERY RATES IN VENDORMANAGED INVENTORY PROGRAMS

Using the latest information technology, powerful retailers like Wal‐Mart have taken the lead in forging shorter replenishment‐cycles, automated supply systems with suppliers. With the objective to reduce cost, these retailers are directing suppliers to take full responsibility for managing stocks and deliveries. Suppliers' performance is measured according to how often inventory is shipped to the retailer, and how often customers are unable to purchase the product because it is out of stock. This emerging trend also implies that suppliers are absorbing a large part of the inventory and delivery costs and, therefore, must plan delivery programs including delivery frequency to ensure that the inherent costs are minimized. With the idea to incorporate this shift in focus, this paper looks at the problem facing the supplier who wants quicker replenishment at lower cost. In particular, we present a model that seeks the best trade‐off among inventory investment, delivery rates, and permitting shortages to occur, given some random demand pattern for the product. The process generating demand consists of two components: one is deterministic and the other is random. The random part is assumed to follow a compound Poisson process. Furthermore, we assume that the supplier may fail to meet uniform shipping schedules, and, therefore, uncertainty is present in delivery times. The solution to this transportationinventory problem requires determining jointly delivery rates and stock levels that will minimize transportation, inventory, and shortage costs. Several numerical results are presented to give a feel of the optimal policy's general behavior.     

A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models

This study proposes a framework for the main parties of a sustainable supply chain network considering lot-sizing impact with quantity discounts under disruption risk among the first studies. The proposed problem differs from most studies considering supplier selection and order allocation in this area. First, regarding the concept of the triple bottom line, total cost, environmental emissions, and job opportunities are considered to cover the criteria of sustainability. Second, the application of this supply chain network is transformer production. Third, applying an economic order quantity model lets our model have a smart inventory plan to control the uncertainties. Most significantly, we present both centralized and decentralized optimization models to cope with the considered problem. The proposed centralized model focuses on pricing and inventory decisions of a supply chain network with a focus on supplier selection and order allocation parts. This model is formulated by a scenario-based stochastic mixed-integer non-linear programming approach. Our second model focuses on the competition of suppliers based on the price of products with regard to sustainability. In this regard, a Stackelberg game model is developed. Based on this comparison, we can see that the sum of the costs for both levels is lower than the cost without the bi-level approach. However, the computational time for the bi-level approach is more than for the centralized model. This means that the proposed optimization model can better solve our problem to achieve a better solution than the centralized optimization model. However, obtaining this better answer also requires more processing time. To address both optimization models, a hybrid bio-inspired metaheuristic as the hybrid of imperialist competitive algorithm (ICA) and particle swarm optimization (PSO) is utilized. The proposed algorithm is compared with its individuals. All employed optimizers have been tuned by the Taguchi method and validated by an exact solver in small sizes. Numerical results show that striking similarities are observed between the results of the algorithms, but the standard deviations of PSO and ICA–PSO show better behavior. Furthermore, while PSO consumes less time among the metaheuristics, the proposed hybrid metaheuristic named ICA–PSO shows more time computations in all small instances. Finally, the provided results confirm the efficiency and the performance of the proposed framework and the proposed hybrid metaheuristic algorithm.

     

PRODUCTION SCHEDULING OF CONTINUOUS FLOW LINES: MULTIPLE PRODUCTS WITH SETUP TIMES AND COSTS

The problem of production planning and setup scheduling of multiple products on a single facility is studied in this paper. The facility can only produce one product at a time. A setup is required when the production switches from one type of product to another. Both setup times and setup costs are considered. The objective is to determine the setup schedule and production rate for each product that minimize the average total costs, which include the inventory, backlog, and setup costs. Under the assumption of a constant production rate, we obtain the optimal cyclic rotation schedule for the multiple products system. Besides the decision variables studied in the classical economic lot scheduling problem (ELSP), the production rate is also a decision variable in our model. We prove that our solutions improve the results of the classical ELSP.     

The Retail Planning Problem Under Demand Uncertainty

We consider the retail planning problem in which the retailer chooses suppliers and determines the production, distribution, and inventory planning for products with uncertain demand to minimize total expected costs. This problem is often faced by large retail chains that carry private‐label products. We formulate this problem as a convex‐mixed integer program and show that it is strongly NP‐hard. We determine a lower bound by applying a Lagrangian relaxation and show that this bound outperforms the standard convex programming relaxation while being computationally efficient. We also establish a worst‐case error bound for the Lagrangian relaxation. We then develop heuristics to generate feasible solutions. Our computational results indicate that our convex programming heuristic yields feasible solutions that are close to optimal with an average suboptimality gap at 3.4%. We also develop managerial insights for practitioners who choose suppliers and make production, distribution, and inventory decisions in the supply chain.     

The benefit of receding horizon control: Near-optimal policies for stochastic inventory control

In this paper we address the single-item, single-stocking point, non-stationary stochastic lot-sizing problem under backorder costs. It is well known that the (s, S) policy provides the optimal control for such inventory systems. However the computational difficulties and the nervousness inherent in (s, S) paved the way for the development of various near-optimal inventory control policies. We provide a systematic comparison of these policies and present their expected cost performances. We further show that when these policies are used in a receding horizon framework the cost performances improve considerably and differences among policies become insignificant.     

The Backroom Effect in Retail Operations

Traditional inventory models fail to take into account the dynamics between the retail sales floor and the backroom, commonly used by retailers for extra storage. When a replenishment order for a given item arrives at a retail store, it may not fit on the allocated shelf space, making backroom storage necessary. In this article, we introduce the backroom effect (BRE) as a consequence of misalignment of case pack size, shelf space, and reorder point. This misalignment results from the fragmented nature of inventory policy decision making in the retail industry and affects basic trade‐offs in inventory models. We specify conditions under which the BRE exists, quantify the expected amount of backroom inventory, derive an optimal short‐term inventory policy, and assess the impact of the BRE on the optimal inventory policy and total costs. Our results indicate that ignoring the BRE leads to artificially high reorder points and higher total costs. The paper concludes with a discussion of theoretical and managerial implications.