Single period stochastic inventory problems with ordering or returns policies

In recent years, there has been an increasing adoption of returns policies in the coordination of the supply chain, where market demand is always assumed to be satisfied by manufacturing or by ordering from suppliers. However, many industries face the important decision of how to balance their inventory level. This problem has long been studied in financial institutions such as banks. This study presents an optimal inventory policy under a given stochastic demand such as a uniformly distributed demand, single-item, and single period review inventory system. The optimal inventory control policy obtained in this study is called a four-point policy: that is, when the entity’s inventory level is below a reorder point, the entity must increase his stock level by ordering and order up-to a fixed level (second point); when the entity’s inventory level is over a return point (third point); the stock level must be decreased by returns and decreased to a fixed level (fourth point); otherwise, nothing should be done. We also analyze the (K, S)-convex properties of the inventory cost function.     

Determination Of Outdate And Shortage Quantities In The Inventory Problem With Fixed Lifetime

The fixed lifetime perishable inventory system is examined and an estimator for the probability that an item will be sold in a period is obtained. The estimator for the probability that an item will be sold is given by \vartheta / S where \vartheta is the average demand per period and S is the inventory level at the start of a period. The probability is used to derive outdate and shortage quantities. Furthermore, shortage-outdate operating curve is obtained. The probability of running out of stock is obtained from the demand distribution. The operating characteristics obtained in this paper are very important because, for practical problems, available mathematically optimal solutions to the fixed lifetime perishable inventory problem cannot be realized due to their computational complexity. Guidelines for managing a real fixed lifetime perishable inventory system are given. A computer program has also been developed to compute the operating characteristics.     

Issuing for perishable inventory management with a minimum inventory volume constraint

We study a perishable inventory system that requires to maintain a minimum inventory volume at all times, where the minimum amount in the constraint is significant with respect to regular market demand and the traditional Economic Manufacturing Quantity (EMQ) models do not suffice. The problem is motivated by applications in homeland security, which are related to the management of pharmaceuticals in the Strategic National Stockpile (SNS) for emergency preparedness. We use a modified EMQ model to represent the system and consider the issuing policy given a fixed ordering quantity, as well as the joint ordering and issuing policy problem. We aim to maximize the profit of the system under a linearly-decreasing price structure assumption. We first present the optimal issuing policy with a given ordering quantity for this modified EMQ model. Then we demonstrate that maximizing the revenue of the ordering policy with FIFO (first-in, first-out) and LIFO (last-in, first-out) issuing policies can be formulated as a non-convex non-smooth unconstrained optimization problem. The properties of both problems (e.g. optimizing issuing policy with a fixed ordering quantity and optimizing ordering policy with a fixed issuing policy) is analyzed and an efficient exact algorithm is presented to solve the joint ordering and issuing problem. We show that the LIFO issuing policy is optimal with a linearly-decreasing price structure that deteriorates with the age of the item.     

A simulation model for evaluating centralized vs. distributed inventory systems

This paper investigates an inventory problem encountered by the retail industry where a single organization operates through several customer outlets. Each outlet stocks several items for which a random demand reduces the level of inventory. The demand is dependent on the location of the outlet and varies from one location to another. Each item is replenished from one or more exogenous suppliers who have a positive delivery lead time. The ordering cost has both fixed and linear components. The items also have linear holding and shortage costs charged at the end of the review period. Inventories of the items are reviewed periodically and ordering decisions taken.     

On continuous review stochastic (s, S) inventory systems with ordering delays

In this paper a continuous review (s, S) inventory system with ordering delays is considered. Demands for the item arrive according to a Poisson process. When the inventory level drops to s, the order is triggered. However, due to an unavoidable delay, the order is actually placed after a random amount of time. Once the order is placed, it is instantaneously delivered bringing the inventory level back to S. Under a cost structure which includes a setup cost, a holding cost and a penalty cost, an expression for the expected cost per unit time for given control values is obtained. Then some properties of the cost functions are developed to characterize the optimal policy. Based on these properties, an efficient search procedure to find the optimal (s, S) policy is presented.     

A lot-size model with discrete transportation costs

This paper deals with an inventory model where transportation costs are considered explicitly. In most situations, it is the buyer who must bear the transportation cost of the goods purchased from the supplier. Such costs are either assumed to be fixed and are therefore included in the ordering cost or variable and included in the item cost, In most realistic situations, it is observed that a fixed cost is incurred for a transport mode such as a truck or wagon irrespective of the quantity loaded. No matter what is the size of the lot, it would always require an integer number of transport modes. Therefore the transportation cost becomes a discrete function. In this paper we develop a lot-size model with discrete transportation costs and present a simple algorithm for the optimal lot-size.     

A multi-server perishable inventory system with negative customer

In this paper, we consider a continuous review perishable inventory system with multi-server service facility. In such systems the demanded item is delivered to the customer only after performing some service, such as assembly of parts or installation, etc. Compared to many inventory models in which the inventory is depleted at the demand rate, however in this model, it is depleted, at the rate at which the service is completed. We assume that the arrivals of customers are according to a Markovian arrival process (MAP) and that the service time has exponential distribution. The ordering policy is based on (s, S) policy. The lead time is assumed to have exponential distribution. The customer who finds either all servers are busy or no item (excluding those in service) is in the stock, enters into an orbit of infinite size. These orbiting customers send requests at random time points for possible selection of their demands for service. The interval time between two successive request-time points is assumed to have exponential distribution. In addition to the regular customers, a second flow of negative customers following an independent MAP is also considered so that a negative customer will remove one of the customers from the orbit. The joint probability distribution of the number of busy servers, the inventory level and the number of customers in the orbit is obtained in the steady state. Various measures of stationary system performance are computed and the total expected cost per unit time is calculated. The results are illustrated numerically.     

A supplier-selection model with classification and joint replenishment of inventory items

Since inventory costs are closely related to suppliers, many models in the literature have selected the suppliers and also allocated orders, simultaneously. Such models usually consider either a single inventory item or multiple inventory items which have independent holding and ordering costs. However, in practice, ordering multiple items from the same supplier leads to a reduction in ordering costs. This paper presents a model in capacity-constrained supplier-selection and order-allocation problem, which considers the joint replenishment of inventory items with a direct grouping approach. In such supplier-selection problems, the following items are considered: a fixed major ordering cost to each supplier, which is independent from the items in the order; a minor ordering cost for each item ordered to each supplier; and the inventory holding and purchasing costs. To solve the developed NP-hard problem, a simulated annealing algorithm was proposed and then compared to a modified genetic algorithm of the literature. The numerical example represented that the number of groups and selected suppliers were reduced when the major ordering cost increased in comparison to other costs. There were also more savings when the number of groups was determined by the model in comparison to predetermined number of groups or no grouping scenarios.     

Maximizing profits in an inventory model with both demand rate and holding cost per unit time dependent on the stock level

We study an EOQ inventory model with demand rate and holding cost rate per unit time, both potentially dependent on the stock level. The ordering cost, the holding cost and the gross profit from the sale of the item are considered. The objective is to maximize the average profit per unit time. We present the analytical formulation of the problem and demonstrate the existence and uniqueness of the optimal cycle time, giving a numerical algorithm to obtain it. Moreover, we provide two fundamental theoretical results: a rule to check when a given cycle time is the optimal policy, and a necessary and sufficient condition for the profitability of the system. Several EOQ models analyzed by other authors are particular cases of the one here studied. We present some numerical examples to illustrate the proposed algorithm and analyze the sensitivity of the optimal solution with respect to changes in various parameters of the system.     

A multi-class closed queueing maintenance network model with a parts inventory system

The system we address is a maintenance network of repairable items where a set of bases is supported by a centrally located repair depot and a consumable replacement parts inventory system. If an item fails, a replacement part must be obtained at the parts inventory system before the failed item enters the repair depot. The ordering policy for the parts is the (S,Q) inventory policy. An approximation method for this system is developed to obtain performance measures such as steady-state probabilities of the number of items at each site and the expected backorders at the parts inventory system. The proposed system is modelled as a multi-class closed queueing network with a synchronization station and analyzed using a product-form approximation method. Particularly, the product-form approximation method is adapted so that the computational effort on estimating the parameters of the equivalent multi-class network is minimized. In analyzing a sub-network, a recursive method is used to solve balance equations by exploiting the special structure of the Markov chain. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interests.     

Locating repair shops in a stochastic environment

In this paper, we consider a repair shop location problem with uncertainties in demand. New repair shops have to be opened at a number of locations. At these local repair shops, customers arrive with broken, but repairable, items. Customers go to the nearest open repair shop. Since they want to leave as soon as possible, an inventory of working items is kept at the repair shops. A customer immediately receives a working item from stock, provided that the stock is not empty. If a stockout occurs, the customer has to wait for a working item. The broken items are repaired in the shop and then put in stock. Sometimes, however, a broken item cannot be fixed at the local repair shop, and it has to be sent to a central repair shop. At the central repair shop the same policy with inventory and repair is used.     

Joint optimization of preventive maintenance and inventory policies for multi-unit systems subject to deteriorating spare part inventory

The interconnection of maintenance and spare part inventory management often puzzles managers and researchers. The deterioration of the inventory affects decision-making and increases losses. Block replacement and periodic review inventory policies were here used to evaluate a joint optimization problem for multi-unit systems in the presence of inventory deterioration. The deterministic deteriorating inventory (DDI) model was used to describe deteriorating inventory when deteriorating inventory data were available and the stochastic deteriorating inventory (SDI) model was used when they were not. Analytical joint optimization models were established, and the preventive replacement interval and the maximum inventory level served as decision variables to minimize the expected system total cost rate. This work proved the existence of the optimal maximum inventory level and gave the uniqueness condition under the DDI model. Numerical experiments based on the electric locomotives in Slovenian Railways were performed to confirm the effectiveness of the proposed models. Results showed the total cost rate to be sensitive to the maximum inventory level, which indicates that the research of this work is necessary. Further, the optimal preventive replacement interval was reduced and the optimal maximum inventory level was increased to balance the influence of deteriorating inventory. Monte Carlo experiments were used to show that the proposed policy is better than policies that do not take deteriorating inventory into account.     

On some optimality conditions and their equivalence in time-dependent inventory models

The paper considers a deterministic, time-and-review-continuous, finite horizon inventory model with general time-dependent demand, holding cost, shortage cost and replenishment rate functions. It gives conditions for the optimal ordering schedule, for a fixed number of replenishments, which reduce the effort for its finding to a simple one-dimensional search. The paper also proves equivalence relationships between the derived optimality conditions and the corresponding ones for special cases of the general model where some of its component functions tend to infinity. It concludes with a discussion concerning the uniqueness of the optimal number of replenishments, and the convergence of the optimal ordering schedule for an infinite time horizon.     

A belief-rule-based inventory control method under nonstationary and uncertain demand

This paper is devoted to investigating inventory control problems under nonstationary and uncertain demand. A belief-rule-based inventory control (BRB-IC) method is developed, which can be applied in situations where demand and demand-forecast-error (DFE) do not follow certain stochastic distribution and forecasting demand is given in single-point or interval styles. The method can assist decision-making through a belief-rule structure that can be constructed, initialized and adjusted using both manager’s knowledge and operational data. An extended optimal base stock (EOBS) policy is proved for initializing the belief-rule-base (BRB), and a BRB-IC inference approach with interval inputs is proposed. A numerical example and a case study are examined to demonstrate potential applications of the BRB-IC method. These studies show that the belief-rule-based expert system is flexible and valid for inventory control. The case study also shows that the BRB-IC method can compensate DFE by training BRB using historical demand data for generating reliable ordering policy.     

Coordinated procurement/inspection and production model under inspection errors

In this study, we investigate integrating the acquisition of input materials, material inspection and production planning, where type I and type II inspection errors are allowed, and the unit acquisition cost is dependent on the average quality level. This study aims to find an optimal purchase lot size (or here, equivalently, the fixed production rate multiplied by the production run time), input quality level and the associated inspection policy that minimize the total cost per item including the order cost, materials purchase cost, setup cost, inventory holding cost, and the quality-related cost. Furthermore, the boundaries, conditions and properties for the optimal production run time are obtained under an optimal inspection policy when the input material quality level is fixed. These findings will facilitate the establishing of an efficient algorithm for an optimal solution. The study demonstrates that a partial inspection approach could dominate over both the commonly used policies of full or no inspection, which is different from a previous report where the optimal inspection policy is either full or no inspection. A numerical example is performed to evaluate the impact of the two types of inspection errors and the process deterioration because of a nonconforming process input on the optimal solution, where a Weibull shift distribution is used to simulate the process failure time. Finally, conclusions are addressed.     

An integrated approach for logistic and vendor managed inventory in supply chain

In this paper, a quaternary policy system towards integrated logistics and inventory aspect of the supply chain has been proposed. A system of multi retailers and distributors, with each distributor following a unique policy, will be analysed. The first policy is continuous time replenishment policy where the retailers’ inventory is replenished in every time interval. In the next three policies, inventory of the retailers will be replenished by some definite policy factors. The vendor managed inventory (VMI) system is used for updating the inventory of the retailers. An order-up-to policy (q, Q) is used for updating the inventory of distributors. Total erstwhile demands to the retailer will be used to determine the amount of inventory acclivity. Furthermore, the distributors will be sending the delivery vehicles to few fellow retailers who are shortlisted according to the policy, followed by the retailers and associated distributors. On the basis of random demand that the retailers are facing from end customers and the total demand that has incurred in the supply chain, products are unloaded to the selected retailers from the delivery vehicle. The path of the delivery vehicle is retrieved by dynamic ant colony optimization. In addition, a framework has been developed to measure the end-customer satisfaction level and total supply chain cost incorporating the inventory holding cost, ordering cost and the transportation cost. The framework has been numerically moulded with different settings to compare the performance of the quadruplet policies.     

On the performance of the base-stock inventory system under a compound Erlang demand distribution

In this paper, we propose a new method for determining the optimal base-stock level in a single echelon inventory system where the demand is a compound Erlang process and the lead-time is constant. The demand inter-arrival follows an Erlang distribution and the demand size follows a Gamma distribution. The stock is controlled according to a continuous review base-stock policy where unfilled demands are backordered. The optimal base-stock level is derived based on a minimization of the total expected inventory cost. A numerical investigation is conducted to analyze the performance of the inventory system with respect to the different system parameters and also to show the outperformance of the approach that is based on the compound Erlang demand assumption as compared to the classical Newsboy approach. This work allows insights to be gained on stock control related issues for both slow and fast moving stock keeping units.     

A generalized model for jointly determining the optimal ordering point and the optimal number of minimal repairs before replacement

Many maintenance policies have assumed that whenever a unit is to he replaced, a new unit is immediately available. However, if the procurement lead time is not negligible, an ordering policy should be considered that determines when to order a spare and when to replace the operating unit after it has begun operating. A generalized model is presented to jointly determine the optimal ordering point and the optimal number of minimal repairs before replacement. By introducing costs due to ordering, repairs, shortage and holding, the expected cost per unit time in the long run is derived as a criterion of optimality, and the optimal ordering point and the optimal number of minimal repairs before replacement are sought by minimizing that cost. Various special cases are discussed. Finally, a numerical example is given.     

Discrete-time spare ordering policy with randomized lead times and discounting

The paper considers a generalized discrete‐time order‐replacement model for a single unit system, which is subject to random failure when in operation. Two types of discrete randomized lead times are considered for a spare unit; one is for regular (preventive) order and another is for expedited (emergency) order. The model is formulated based on the discounted cost criterion. The underlying two‐dimensional optimization problem is reduced to a simple one‐dimensional one and then the optimal ordering policy for the spare unit is characterized under two extreme conditions: (i) unlimited inventory time and (ii) zero inventory time for the spare unit. A numerical example is used to determine the optimal spare‐ordering policy numerically and to examine the sensitivity of the model parameters.     

A minimax distribution free procedure for mixed inventory model involving variable lead time with fuzzy demand

In a recent paper, Ouyang and Wu applied the minimax decision approach to solve a continuous review mixed inventory model in which the lead time demand distribution information is unknown but the annual demand is fixed and given. However, in the practical situation, the annual demand probably incurs disturbance due to various uncertainties. In this article, we attempt to modify Ouyang and Wu's model by considering two fuzziness of annual demand (i.e., fuzzy number of annual demand and statistic-fuzzy number of annual demand) and to investigate a computing schema for the continuous review inventory model in the fuzzy sense. We give an algorithm procedure to obtain the optimal ordering strategy for each case.Scope and purposeIn most of the early literature dealing with inventory problems, either using deterministic or probabilistic models, lead time is viewed as a prescribed constant or a stochastic variable. Recently, some researchers (e.g., Liao and Shyu, Ben-Daya and Raouf, and Ouyang and Wu) incorporated the crashing lead time idea to continuous review inventory models, in which the annual demand is given and fixed. However, in the real situation, the annual demand will probably have a little disturbance due to various uncertainties. The purpose of this article is to modify the Ouyang and Wu's model to accommodate this reality, specifically, we apply the fuzzy set concepts to deal with the uncertain annual demand. We first consider a case where the annual demand is treated as the triangular fuzzy number. Then, we employ the statistical method to construct a confidence interval for the annual demand, and through it to establish the corresponding fuzzy number (namely, the statistic-fuzzy number). For each fuzzy case, we investigate a computing schema for the new model and develop an algorithm to find the optimal ordering strategy.