Some remarks on an optimal order quantity and reorder point when supply and demand are uncertain

In the reports in the literature on inventory control, the effects of the random capacity on an order quantity and reorder point inventory control model have been integrated with lead time demand following general distribution. An iterative solution procedure has been proposed for obtaining the optimal solution. However, the resulting solution may not exist or it may not guarantee to give a minimum to the objective cost function, the expected cost per unit time. The aim of this study was to introduce a complete solution of the order quantity/reorder point problem, optimality, properties and bounds on the optimal order quantity and reorder point. The two most appealing distributions of lead time demand, normal and uniform distributions, in conjunction with an exponentially distributed capacity, are used to illustrate our findings in determining the optimal order quantity and reorder point.     

The lot size-reorder level inventory system with customers impatience functions

In this paper, we study a continuous review inventory model with deterministic demand. The model allows shortages, which are partially backlogged. The backlogging is characterized using an approach in which customers are considered impatient. Total profit function is developed using three general costs: holding cost, order cost and shortage cost. Holding cost is based on average stocks and order cost is fixed per replenishment. In shortage cost, we include three significant costs: the unit backorder cost (depending on the shortage time), the goodwill cost (constant) and the opportunity cost. A general approach is presented to determine the economic lot size, the reorder level and the minimum total inventory cost. We consider two customers impatience functions to illustrate the application of the procedure. This paper extends several models studied by other authors.     

Lot size reorder point inventory model with controllable lead time and set-up cost

This paper deals with the lead time and set-up cost reductions problem on the modified lot size reorder point inventory model in which the production process is imperfect. We consider that the lead time can be shortened at an extra crashing cost, which depends on the length of lead time to be reduced and the ordering lot size. The option of investing in reducing set-up cost is also included. Two commonly used investment cost functional forms, logarithmic and power, are employed for set-up cost reduction. We assume that the stochastic demand during lead time follows a Normal distribution. The objective is simultaneously to optimize the lot size, reorder point, set-up cost and lead time. An algorithm of finding the optimal solution is developed, and two numerical examples are given to illustrate the results.     

Multi-Objective Optimization of Slow Moving Inventory System Using Cuckoo Search

This paper focuses on the development of a multi-objective lot size–reorder point backorder inventory model for a slow moving item. The three objectives are the minimization of (1) the total annual relevant cost, (2) the expected number of stocked out units incurred annually and (3) the expected frequency of stockout occasions annually. Laplace distribution is used to model the variability of lead time demand. The multi-objective Cuckoo Search (MOCS) algorithm is proposed to solve the model. Pareto curves are generated between cost and service levels for decision-makers. A numerical problem is considered on a slow moving item to illustrate the results. Furthermore, the performance of the MOCS algorithm is evaluated in comparison to multi-objective particle swarm optimization (MOPSO) using metrics, such as error ratio, maximum spread and spacing.     

Periodic review fuzzy inventory model with variable lead time and fuzzy demand

This paper investigates a periodic review fuzzy inventory model with lead time, reorder point, and cycle length as decision variables. The main goal of this study is to minimize the expected total annual cost by simultaneously optimizing cycle length, reorder point, and lead time for the whole system based on fuzzy demand. Two models are considered in this paper: one with normal demand distribution and another with a distribution‐free approach. The model assumes a logarithmic investment function for lost‐sale rate reduction. Furthermore, two separate efficient computational algorithms are explained to obtain the optimal solution. Some numerical examples are given to illustrate the model.     

A mathematical model for order splitting in a multiple supplier single-item inventory system

In this paper we develop a mathematical model which considers multiple-supplier single-item inventory systems. The lead times of the suppliers and demand arrival rate are random variables. All shortages are backordered. Continuous review (s, Q) policy has been assumed. When the inventory level hits the reorder level, the total order is split among n suppliers. The problem is to determine the reorder level and order quantity for each supplier so that the expected total cost per time unit, including ordering cost, procurement cost, inventory holding cost and shortage cost is minimized. We also conduct extensive numerical experiments to show the advantages of our model compared to the relevant models in the literature. In addition, some managerial insights are observed.     

Fuzzy inference systems and inventory allocation decisions: Exploring the impact of priority rules on total costs and service levels

Inventory allocation decisions in a distribution system concern issues such as how much and where stock should be assigned to orders in a supply chain. When the inventory level of an inventory point is lower than the total number of items ordered by lower echelons in the chain, the decision of how many items to allocate to each ``competing'' order must take into consideration the trade-off between cost and service level. This paper proposes a decision-support system that makes use of fuzzy logic to consider inventory carrying, shortage and ordering costs as well as transportation costs. The proposed system is compared through simulation with three other inventory allocation decision support models in terms of cost and service levels achieved. Conclusions are then drawn.     

Economic production quantity with rework process at a single-stage manufacturing system with planned backorders

In traditional inventory models such as the economic order quantity (EOQ) and the economic production quantity (EPQ) the sole objective is to minimize the total inventory-related costs, typically holding cost and ordering cost. These models do not consider the presence of defective products in the lot or rework of them. Recently, Jamal, Sarker, and Mondal (Jamal, A. A. M., Sarker, B. R., & Mondal, S., (2004). Optimal manufacturing batch size with rework process at single-stage production system. Computers and Industrial Engineering, 47(1), 77–89) proposed a model, which dealt with the optimum batch quantity in a single-stage system in which rework is done by addressing two different operational policies to minimize the total system cost, but their models do not consider planned backorders. In this direction, this paper develops an EPQ type inventory model with planned backorders for determining the economic production quantity for a single product, which is manufactured in a single-stage manufacturing system that generates imperfect quality products, and all these defective products are reworked in the same cycle. We also establish the range of real values of the proportion of defective products for which there is an optimal solution, and the close form for the total cost of inventory system. The use of the inventory model is illustrated with numerical examples. The classical EOQ, EPQ inventory models with or without planned backorders and Jamal, Sarker and Mondal’s model (Jamal, A. A. M., Sarker, B. R., & Mondal, S., (2004). Optimal manufacturing batch size with rework process at single-stage production system. Computers and Industrial Engineering, 47(1), 77–89) are shown to be special cases of the EPQ inventory model presented in this paper.     

模糊随机决策环境下的核电站不常用条件(Q,r)库存模型

针对固定提前期内的需求为三角模糊变量,且用户总需求为梯形模糊随机变量的情形下,构建了不常用备件连续盘点模式下的（Q,r）模型,并推导出模糊成本最小化函数,进而利用基于模糊数期望值理论的去模糊化方法,求出最优订货点及订货量．最后,通过一个实例验证了模型的科学性和实用性．     

Sole versus dual sourcing under order dependent lead times and prices

In this paper, we consider a dual-sourcing model with constant demand and stochastic lead times. Two suppliers may be different in terms of purchasing prices and lead-time parameters. The ordering takes place when the inventory level depletes to a reorder level, and the order is split among two suppliers. Unlike previous works in the order splitting literature, the supply lead time between vendor and buyer as well as unit purchasing prices is considered to be order quantity dependent. The proposed model finds out the optimal reorder point, order quantity and splitting proportion, using a solution procedure. Numerical results show that neglecting the relationship between ordering batch size and lead times is a shortcoming that hides one of order splitting advantages. Moreover, connecting unit prices to order quantity can decrease the percentage saving from dual sourcing compared to sole sourcing. Furthermore, sensitivity analysis shows some managerial insights.     

Dynamic reorder point replenishment strategies for a capacitated supply chain with seasonal demand

Managing inventory and service levels in a capacitated supply chain environment with seasonal demand requires appropriate selection and readjustment of replenishment decision variables. This study focuses on the dynamic adjustment of decision variables within supply chains using continuous-review reorder point (ROP) replenishment. A framework is proposed to adjust reorder points and lot sizes based on optimal settings within different regions of a seasonal demand cycle. This framework also includes the optimal timing of adjustments defining these regions. A discrete-event simulation model of a simple, capacity-constrained supply chain is developed and simulation–optimization experiments are performed, the objective being to minimize the total supply chain inventory subject to a target delivery service level. The performance of ROP systems with optimal static and optimal dynamic decision variable settings are compared using two different seasonal demand patterns. The results confirm that performance with dynamic decision variable adjustment is better. For a given delivery service level, average work-in-process inventory levels are almost the same for both systems. However average finished goods inventory levels decrease significantly and are more stable under dynamic adjustment. The practical implication is that both finished goods holding costs and maximum storage capacity requirements are reduced.     

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.     

The benefit of VMI strategies in a stochastic multi-product serial two echelon system

We consider a multi-product serial two echelon inventory system with stochastic demand. Inventories at the downstream location are replenished periodically using an automatic ordering system. Under vendor managed inventory strategies the upstream stage is allowed to adapt these orders in order to benefit from economies of scale. We propose three different VMI strategies, aiming to reduce the order picking cost at the upstream location and the transportation costs resulting in reduced total supply chain costs. In a detailed numerical study the VMI strategies are compared with a retailer managed inventory strategy for two different demand models suitable for slow moving products. It is shown that if inventory holding costs are low, compared to handling and transportation costs, efficiencies at the warehouse are improved and total supply chain costs are reduced.     

The (<Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>, <Emphasis Type="Italic">r</Emphasis>, <Emphasis Type="Italic">l</Emphasis>) model for stochastic demand under Intuitionistic fuzzy aggregation with Bonferroni mean

This paper investigates a hill type economic production-inventory quantity (EPIQ) model with variable lead-time, order size and reorder point for uncertain demand. The average expected cost function is formulated by trading off costs of lead-time, inventory, lost sale and partial backordering. Due to the nature of the demand function, the frequent peak (maximum) and valley (minimum) of the expected cost function occur within a specific range of lead time. The aim of this paper is to search the lowest valley of all the valley points (minimum objective values) under fuzzy stochastic demand rate. We consider Intuitionistic fuzzy sets for the parameters and used Intuitionistic Fuzzy Aggregation Bonferroni mean for the defuzzification of the hill type EPIQ model. Finally, numerical examples and graphical illustrations are made to justify the model.     

Multiproduct multiple-buyer single-vendor supply chain problem with stochastic demand, variable lead-time, and multi-chance constraint

In this paper, a multi-product multi-chance constraint joint single-vendor multi-buyers inventory problem is considered in which the demand follows a uniform distribution, the lead-time is assumed to vary linearly with respect to the lot size, and the shortage in combination of backorder and lost-sale is assumed. Furthermore, the orders are placed in multiple of packets, there is a limited space available for the vendor, there are chance constraints on the vendor service rate to supply the products, and there is a limited budget for each buyer to purchase the products. While the elements of the buyers’ cost function are holding, shortage, order and transportation costs, the set up and holding costs are assumed for the vendor. The goal is to determine the re-order point and the order quantity of each product for each buyer such that the chain total cost is minimized. We show the model of this problem to be a mixed integer nonlinear programming type and in order to solve it a particle swarm optimization (PSO) approach is used. To justify the results of the proposed PSO algorithm, a genetic algorithm (GA) is applied as well to solve the problem. Then, the quality of the results and the CPU times of reaching the solution are compared through three numerical examples that are given to demonstrate the applicability of the proposed methodology in real world inventory control problems. The comparison results show the PSO approach has better performances than the GA method.     

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.     

A coordinated approach to hedge the risks in stochastic inventory-routing problem

The inventory routing problem (IRP) studied in this research involves repeated delivery of products from a depot to a set of retailers that face stochastic demands over a long period. The main objective in the IRP is to design the set of routes and delivery quantities that minimize transportation cost while controlling inventory costs. Traditional IRP focuses on risk-neutral decision makers, i.e., characterizing replenishment policies that maximize expected total net present value, or equivalently, minimize expected total cost over a planning horizon. In this research, for incorporating risk aversion, a hedge-based stochastic inventory-routing system (HSIRS) integrated with Generalized Autoregressive Conditional Heteroskedasticity (GARCH) model and Forward Option Pricing (FOP)model based on Black-Scholes model, from hedge point of view, is proposed to solve the multi-product multi-period inventory routing problem with stochastic demand. Computational results demonstrate the importance of this approach not only to risk-averse decision makers, but also to maximize the net present value at an acceptable service level. As a result, an optimal portfolio (R, s, S) system of product group can be generated to maximize the net present value under an acceptable service level in a given planning horizon. Meanwhile, the target group needed to be served and the relative transportation policy also can be determined accordingly based on the time required to be served as a priori partition to minimize the average transportation costs; hence, the routing assignment problem can be successfully optimized through a Predicting Particle Swarm Optimization algorithm.     

Integrated optimization of inventory-distribution systems by random local search and a genetic algorithm

A new model and its solution procedure for the commodity distribution system consisting of distribution centers and consumer points are discussed. Demand is assumed to be a random variable that obeys a known, stationary probability distribution. An integrated optimization model is built where both the order-up-to-R policy, which is one of the typical inventory policies for periodic review models, and the transportation problem are considered simultaneously. The assignment of consumer points to distribution centers is not fixed. The problem is to determine the target inventory and the transportation quantity in order to minimize the expectation of the sum of inventory related costs and transportation costs. Simulation and linear programming are used to calculate the expected costs, and a random local search method is developed in order to determine the optimum target inventory. A genetic algorithm is also tested and compared with the proposed random local search method. The model and effectiveness of the proposed solution procedure are clarified by computational experiments.     

Optimal production lot size and reorder point of a two-stage supply chain while random demand is sensitive with sales teams' initiatives

The paper develops a production-inventory model of a two-stage supply chain consisting of one manufacturer and one retailer to study production lot size/order quantity, reorder point sales teams’ initiatives where demand of the end customers is dependent on random variable and sales teams’ initiatives simultaneously. The manufacturer produces the order quantity of the retailer at one lot in which the procurement cost per unit quantity follows a realistic convex function of production lot size. In the chain, the cost of sales team's initiatives/promotion efforts and wholesale price of the manufacturer are negotiated at the points such that their optimum profits reached nearer to their target profits. This study suggests to the management of firms to determine the optimal order quantity/production quantity, reorder point and sales teams’ initiatives/promotional effort in order to achieve their maximum profits. An analytical method is applied to determine the optimal values of the decision variables. Finally, numerical examples with its graphical presentation and sensitivity analysis of the key parameters are presented to illustrate more insights of the model.     

Integrated vendor--buyer inventory system with sublot sampling inspection policy and controllable lead time

This article investigates the impact of inspection policy and lead time reduction on an integrated vendor--buyer inventory system. We assume that an arriving order contains some defective items. The buyer adopts a sublot sampled inspection policy to inspect selected items. The number of defective items in the sublot sampling is a random variable. The buyer's lead time is assumed reducible by adding crash cost. Two integrated inventory models with backorders and lost sales are derived. We first assume that the lead time demand follows a normal distribution, and then relax the assumption about the lead time demand distribution function and apply the minimax distribution-free procedure to solve the problem. Consequently, the order quantity, reorder point, lead time and the number of shipments per lot from the vendor to the buyer are decision variables. Iterative procedures are developed to obtain the optimal strategy.