A two-echelon inventory model with lost sales

This paper considers a single-item, two-echelon, continuous-review inventory model. A number of retailers have their stock replenished from a central warehouse. The warehouse in turn replenishes stock from an external supplier. The demand processes on the retailers are independent Poisson. Demand not met at a retailer is lost. The order quantity from each retailer on the warehouse and from the warehouse on the supplier takes the same fixed value Q, an exogenous variable determined by packaging and handling constraints. Retailer i follows a (Q, R_i) control policy. The warehouse operates an (SQ, (S − 1)Q) policy, with non-negative integer S. If the warehouse is in stock then the lead time for retailer i is the fixed transportation time L_i from the warehouse to that retailer. Otherwise retailer orders are met, after a delay, on a first-come first-served basis. The lead time on a warehouse order is fixed. Two further assumptions are made: that each retailer may only have one order outstanding at any time and that the transportation time from the warehouse to a retailer is not less than the warehouse lead time. The performance measures of interest are the average total stock in the system and the fraction of demand met in the retailers. Procedures for determining these performance measures and optimising the behaviour of the system are developed.     

Analysis of a two-echelon inventory system with two supply modes

In this paper, we consider a serial two-echelon periodic review inventory system with two supply modes at the most upstream stock point. As control policy for this system, we propose a natural extension of the dual-index policy, which has three base-stock levels. We consider the minimization of long run average inventory holding, backlogging, and both per unit and fixed emergency ordering costs. We provide nested newsboy characterizations for two of the three base-stock levels involved and show a separability result for the difference with the remaining base-stock level. We extend results for the single-echelon system to efficiently approximate the distributions of random variables involved in the newsboy equations and find an asymptotically correct approximation for both the per unit and fixed emergency ordering costs. Based on these results, we provide an algorithm for setting base-stock levels in a computationally efficient manner. In a numerical study, we investigate the value of dual-sourcing in supply chains and illustrate that dual-sourcing can lead to significant cost savings in cases with high demand uncertainty, high backlogging cost or long lead times.     

A simulation optimization approach for a two-echelon inventory system with service level constraints

In this paper, we present a simulation optimization algorithm for solving the two-echelon constrained inventory problem. The goal is to determine the optimal setting of stocking levels to minimize the total inventory investment costs while satisfying the expected response time targets for each field depot. The proposed algorithm is more adaptive than ordinary optimization algorithms, and can be applied to any multi-item multi-echelon inventory system, where the cost structure and service level function resemble what we assume. Empirical studies are performed to compare the efficiency of the proposed algorithms with other existing simulation algorithms.     

A two-echelon inventory model for a deteriorating item with stock-dependent demand,partial backlogging and capacity constraints

This study investigates a two-echelon supply chain model for deteriorating inventory in which the retailer’s warehouse has a limited capacity. The system includes one wholesaler and one retailer and aims to minimise the total cost. The demand rate in retailer is stock-dependent and in case of any shortages, the demand is partially backlogged. The warehouse capacity in the retailer (OW) is limited; therefore the retailer can rent a warehouse (RW) if needed with a higher cost compared to OW. The optimisation is done from both the wholesaler’s and retailer’s perspectives simultaneously. In order to solve the problem a genetic algorithm is devised. After developing a heuristic a numerical example together with sensitivity analysis are presented. Finally, some recommendations for future research are presented.     

A multi-product continuous review inventory system in stochastic environment with budget constraint

Common characteristics of inventory systems include uncertain demand and restrictions such as budgetary and storage space constraints. Several authors have examined budget constrained multi-item stochastic inventory systems controlled by continuous review policies without considering marginal review shortage costs. Existing models assume that purchasing costs are paid at the time an order is placed, which is not always the case since in some systems purchasing costs are paid when order arrive. In the latter case the maximum investment in inventory is random since the inventory level when an order arrives is a random variable. Hence payment of purchasing costs on delivery yields a stochastic budget constraint for inventory. In this paper with mixture of back orders and lost sales, we assume that mean and variance of lead time demand are known but their probability distributions are unknown. After that, we apply the minimax distribution free procedure to find the minimum expected value of the random objective function with budget constraint. The random budget constraint is transformed to crisp budget constraint by chance-constraint technique. Finally, the model is illustrated by a numerical example.     

A cooperative inventory policy with deteriorating items for a two-echelon model

A cooperative inventory policy between supplier and buyer is proposed. Unlike other studies, we consider the case of deteriorating items and permit the completed back-order in the problem. We solve the problem without the condition of equal replenishments periods during a specified planning horizon and present a procedure to find the optimal solution. A case is presented to demonstrate the application of the proposed approach. The sensitivity analysis for a cooperation policy between supplier and buyer also are explored.     

Perishable inventory management system with a minimum volume constraint

The federal government maintains large quantities of medical supplies in stock as part of its Strategic National Stockpile (SNS) to protect the American public in case of a public health emergency. Managing these large perishable inventories effectively can help reduce the cost of the SNS and improves national security. In this paper, we propose a modified Economic Manufacturing Quantity (EMQ) model for perishable inventory with a minimum volume constraint, which is applicable to managing the inventory of medicines for the Strategic National Stockpile. We demonstrate that minimizing the cost of maintaining such a system can be formulated as a non-convex non-smooth unconstrained optimization problem. The property of this model is analysed and an efficient exact algorithm is presented to solve this problem. In the numerical experiment part, we perform sensitivity analysis on several government-controlled system parameters to illustrate how the government can obtain lower costs or a larger stockpile at the same cost by allowing more freedom in the management of the stocks.     

Some two-echelon style-goods inventory models with asymmetric market information

A “two-echelon” newsboy problem considers the interactive decisions between the “manufacturer” and the “retailer” – now recognized as two separate entities. Earlier papers on this problem assumed that the two parties share the same market information. We extend this problem by studying the situation in which the retailer has better market information than the manufacturer. Presented are several decision models that should be useful for guiding a manufacturer's decisions. Moreover, solutions to these models lead to various unexpected and interesting conclusions. For example, we found that improved retailer's market-knowledge always benefits the manufacturer and the system, though not necessarily the retailer himself. In contrast, improved manufacturer's knowledge benefits only the manufacturer himself at the expense of the retailer and of the system.     

Deterministic inventory model for deteriorating items with capacity constraint and time-proportional backlogging rate

In this paper, a deterministic inventory model for deteriorating items with two warehouses is developed. A rented warehouse is used when the ordering quantity exceeds the limited capacity of the owned warehouse, and it is assumed that deterioration rates of items in the two warehouses may be different. In addition, we allow for shortages in the owned warehouse and assume that the backlogging demand rate is dependent on the duration of the stockout. We obtain the condition when to rent the warehouse and provide simple solution procedures for finding the maximum total profit per unit time. Further, we use a numerical example to illustrate the model and conclude the paper with suggestions for possible future research.     

A multi-agent inventory problem with general transportation costs

This paper addresses the cost allocation problem that arises from an inventory system with multiple item and several agents that place joint orders according to an EOQ policy. In this setting, the cost per a new order has two components: a fixed cost and a variable cost. We assume that the variable part is given by a general function, not necessarily additive. We obtain the optimal policy and we evaluate some proposals of allocation rule for the ordering costs.     

Determining the Pareto set in a bicriteria two-echelon inventory/distribution system

This article concerns two-echelon inventory/distribution system, consisting of a warehouse and a retailer. We assume that the demand is deterministic and stockouts are not permitted. Two criteria are considered: to minimize the annual inventory cost and the annual total number of damaged items by improper shipment handling. The problem consists of determining the non-dominated inventory policies in such a way that the trade-off between both criteria is achieved. We present the characterization of the non-dominated optimal solution set and we use this result to correct the solution method previously proposed by other authors for a problem with identical cost structure. An efficient algorithm to calculate the non-dominated solution set is introduced. Computational results on several randomly generated problems are reported.     

On two-echelon inventory systems with Poisson demand and lost sales

We consider a two-echelon, continuous review inventory system under Poisson demand and a one-for-one replenishment policy. Demand is lost if no items are available at the local warehouse, the central depot, or in the pipeline in between. We give a simple, fast and accurate approach to approximate the service levels in this system. In contrast to other methods, we do not need an iterative analysis scheme. Our method works very well for a broad set of cases, with deviations to simulation below 0.1% on average and below 0.36% for 95% of all test instances.     

Hybrid algorithm for a vendor managed inventory system in a two-echelon supply chain

In this paper we address the issue of vendor managed inventory (VMI) by considering a two-echelon single vendor/multiple buyer supply chain network. We try to find the optimal sales quantity by maximizing profit, given as a nonlinear and non-convex objective function. For such complicated combinatorial optimization problems, exact algorithms and optimization commercial software such as LINGO are inefficient, especially on practical-size problems. In this paper we develop a hybrid genetic/simulated annealing algorithm to deal with this nonlinear problem. Our results demonstrate that the proposed hybrid algorithm outperforms previous methodologies and achieves more robust solutions.     

A solid transportation problem with mixed constraint in different environment

In this paper, we have introduced a Solid Transportation Problem where the constrains are mixed type. The model is developed under different environment like, crisp, fuzzy and intuitionistic fuzzy etc. Using the interval approximation method we defuzzify the fuzzy amount and for intuitionistic fuzzy set we use the ($\alpha,\beta$)-cut sets to get the corresponding crisp amount. To find the optimal transportation units a time and space based with order of convergence $O (MN^2)$ meta-heuristic Genetic Algorithm have been proposed. Also the equivalent crisp model so obtained are solved by using LINGO 13.0. The results obtained using GA treats as the best solution by comparing with LINGO results for this present study. The proposed models and techniques are finally illustrated by providing numerical examples. Degree of efficiency have been find out for both the algorithm.     

A multi-product continuous review inventory system with stochastic demand,backorders, and a budget constraint

Common characteristics of inventory systems include uncertain demand and restrictions such as budgetary or storage space constraints. Several authors have examined budget constrained multi-item stochastic inventory systems controlled by continuous review policies without considering marginal shortage costs. Existing models assume that purchasing costs are paid at the time an order is placed, which is not always the case since in some systems purchasing costs are paid when orders arrive. In the latter case the maximum investment in inventory is random since the inventory level when an order arrives is a random variable. Hence payment of purchasing costs on delivery yields a stochastic budget constraint for inventory. This paper models a multi-item stochastic inventory system with backordered shortages when estimation of marginal backorder cost is available, and payment is due upon order arrival. The budget constraint can easily be converted into a storage constraint.     

Integrated location and two-echelon inventory network design under uncertainty

In this paper, we propose a two-stage stochastic model to address the design of an integrated location and two-echelon inventory network under uncertainty. The central issue in this problem is to design and operate an effective and efficient multi-echelon supply chain distribution network and to minimize the expected system-wide cost of warehouse location, the allocation of warehouses to retailers, transportation, and two-echelon inventory over an infinite planning horizon. We structure this problem as a two-stage nonlinear discrete optimization problem. The first stage decides the warehouses to open and the second decides the warehouse-retailer assignments and two-echelon inventory replenishment strategies. Our modeling strategy incorporates various probable scenarios in the integrated multi-echelon supply chain distribution network design to identify solutions that minimize the first stage costs plus the expected second stage costs. The two-echelon inventory cost considerations result in a nonlinear objective which we linearize with an exponential number of variables. We solve the problem using column generation. Our computational study indicates that our approach can solve practical problems of moderate-size with up to twenty warehouse candidate locations, eighty retailers, and ten scenarios efficiently.     

A note on multi-item inventory systems with limited capacity

Functional relationships between the Lagrange multiplier and system parameters for multi-item inventory systems with one restriction are identified and used to establish tight bounds on the optimal multiplier value. A recursive process which rapidly converges to the optimal multiplier is also discussed. Finally, a comparative analysis of the new bounds in relation to existing bounds is presented.     

Synchronization of inventory and transportation under flexible vehicle constraint: A heuristics approach using sliding windows and hierarchical tree structure

This paper investigates the integrated inventory and transportation planning under flexible vehicle constraint. To offer better services at lower prices, more and more companies turn to outsource transportation functions to other professional service providers, namely 3rd party logistics companies. Under these vehicle rental arrangements, the number of vehicles is a decision variable instead of a fixed number, and the transportation cost includes not only the delivery cost but also the cost of vehicle rental that is proportional to the number of vehicles rented in a given planning horizon. In this paper, the problem is formulated as a mixed integer programming problem. A heuristic algorithm is developed, in which sliding windows are applied to approximate the problem by repeatedly solving a series of overlapping short-term subproblems, and a hierarchical tree structure is used to evaluate the closeness of different groups of retailers. Numerical experiments show that a better tradeoff between the inventory cost and transportation cost can be achieved through the proposed heuristic algorithm.